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 --cacsl2boogietranslator.bitprecise.bitfields false -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-12 06:30:54,028 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 06:30:54,030 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 06:30:54,042 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 06:30:54,042 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 06:30:54,043 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 06:30:54,044 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 06:30:54,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 06:30:54,047 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 06:30:54,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 06:30:54,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 06:30:54,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 06:30:54,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 06:30:54,050 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 06:30:54,051 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 06:30:54,052 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 06:30:54,054 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 06:30:54,055 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 06:30:54,056 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 06:30:54,057 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 06:30:54,058 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 06:30:54,059 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 06:30:54,059 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 06:30:54,060 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 06:30:54,060 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 06:30:54,061 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 06:30:54,062 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 06:30:54,062 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 06:30:54,063 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 06:30:54,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 06:30:54,063 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 06:30:54,063 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-12 06:30:54,083 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 06:30:54,084 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 06:30:54,084 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 06:30:54,085 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 06:30:54,085 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 06:30:54,085 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 06:30:54,085 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 06:30:54,085 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 06:30:54,085 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 06:30:54,085 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 06:30:54,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 06:30:54,085 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 06:30:54,085 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 06:30:54,086 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 06:30:54,086 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 06:30:54,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 06:30:54,086 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 06:30:54,086 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 06:30:54,086 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 06:30:54,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 06:30:54,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 06:30:54,086 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 06:30:54,087 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 06:30:54,087 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 06:30:54,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 06:30:54,119 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 06:30:54,122 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 06:30:54,123 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 06:30:54,123 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 06:30:54,124 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-12 06:30:54,397 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG5d003046f [2018-04-12 06:30:54,585 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 06:30:54,585 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 06:30:54,586 INFO L168 CDTParser]: Scanning length_test03_false-valid-memtrack.i [2018-04-12 06:30:54,593 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 06:30:54,593 INFO L215 ultiparseSymbolTable]: [2018-04-12 06:30:54,593 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 06:30:54,593 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-12 06:30:54,593 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-12 06:30:54,594 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-12 06:30:54,594 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in length_test03_false-valid-memtrack.i [2018-04-12 06:30:54,594 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 06:30:54,594 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-12 06:30:54,594 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-12 06:30:54,594 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-12 06:30:54,594 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-12 06:30:54,594 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-12 06:30:54,594 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-12 06:30:54,594 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-12 06:30:54,594 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-12 06:30:54,595 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-12 06:30:54,595 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-12 06:30:54,595 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-12 06:30:54,595 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-12 06:30:54,595 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-12 06:30:54,595 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-12 06:30:54,595 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-12 06:30:54,595 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-12 06:30:54,595 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-12 06:30:54,595 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-12 06:30:54,595 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-12 06:30:54,595 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-12 06:30:54,595 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-12 06:30:54,595 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-12 06:30:54,595 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-12 06:30:54,595 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-12 06:30:54,595 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-12 06:30:54,596 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-12 06:30:54,596 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-12 06:30:54,596 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-12 06:30:54,596 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-12 06:30:54,596 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-12 06:30:54,596 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-12 06:30:54,596 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-12 06:30:54,596 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-12 06:30:54,596 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-12 06:30:54,596 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-12 06:30:54,597 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-12 06:30:54,597 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-12 06:30:54,597 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-12 06:30:54,597 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-12 06:30:54,597 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-12 06:30:54,597 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-12 06:30:54,597 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-12 06:30:54,597 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-12 06:30:54,597 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-12 06:30:54,597 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-12 06:30:54,598 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-12 06:30:54,598 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-12 06:30:54,598 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-12 06:30:54,598 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-12 06:30:54,598 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-12 06:30:54,598 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-12 06:30:54,598 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-12 06:30:54,598 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-12 06:30:54,598 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-12 06:30:54,598 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-12 06:30:54,598 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-12 06:30:54,599 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-12 06:30:54,599 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-12 06:30:54,599 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-12 06:30:54,599 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-12 06:30:54,599 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-12 06:30:54,599 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-12 06:30:54,599 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-12 06:30:54,599 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-12 06:30:54,599 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-12 06:30:54,599 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-12 06:30:54,599 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-12 06:30:54,599 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-12 06:30:54,600 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-12 06:30:54,600 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-12 06:30:54,600 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-12 06:30:54,600 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-12 06:30:54,600 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-12 06:30:54,600 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-12 06:30:54,600 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-12 06:30:54,600 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-12 06:30:54,600 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-12 06:30:54,600 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-12 06:30:54,601 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-12 06:30:54,601 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-12 06:30:54,601 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-12 06:30:54,601 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-12 06:30:54,601 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-12 06:30:54,601 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-12 06:30:54,601 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-12 06:30:54,601 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-12 06:30:54,601 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-12 06:30:54,601 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-12 06:30:54,601 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-12 06:30:54,601 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-12 06:30:54,602 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-12 06:30:54,602 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-12 06:30:54,602 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-12 06:30:54,602 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-12 06:30:54,602 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-12 06:30:54,602 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-12 06:30:54,602 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-12 06:30:54,602 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-12 06:30:54,602 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-12 06:30:54,602 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-12 06:30:54,602 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-12 06:30:54,602 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-12 06:30:54,602 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-12 06:30:54,602 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-12 06:30:54,603 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-12 06:30:54,603 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-12 06:30:54,603 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-12 06:30:54,603 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-12 06:30:54,603 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-12 06:30:54,603 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-12 06:30:54,603 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-12 06:30:54,603 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-12 06:30:54,603 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-12 06:30:54,603 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-12 06:30:54,603 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-12 06:30:54,603 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-12 06:30:54,603 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-12 06:30:54,604 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-12 06:30:54,604 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-12 06:30:54,618 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG5d003046f [2018-04-12 06:30:54,621 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 06:30:54,622 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 06:30:54,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 06:30:54,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 06:30:54,627 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 06:30:54,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 06:30:54" (1/1) ... [2018-04-12 06:30:54,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21497f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:30:54, skipping insertion in model container [2018-04-12 06:30:54,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 06:30:54" (1/1) ... [2018-04-12 06:30:54,639 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 06:30:54,662 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 06:30:54,788 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 06:30:54,826 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 06:30:54,832 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 119 non ball SCCs. Number of states in SCCs 119. [2018-04-12 06:30:54,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:30:54 WrapperNode [2018-04-12 06:30:54,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 06:30:54,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 06:30:54,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 06:30:54,867 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 06:30:54,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:30:54" (1/1) ... [2018-04-12 06:30:54,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:30:54" (1/1) ... [2018-04-12 06:30:54,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:30:54" (1/1) ... [2018-04-12 06:30:54,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:30:54" (1/1) ... [2018-04-12 06:30:54,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:30:54" (1/1) ... [2018-04-12 06:30:54,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:30:54" (1/1) ... [2018-04-12 06:30:54,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:30:54" (1/1) ... [2018-04-12 06:30:54,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 06:30:54,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 06:30:54,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 06:30:54,911 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 06:30:54,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:30:54" (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-12 06:30:54,997 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 06:30:54,997 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 06:30:54,997 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_32 [2018-04-12 06:30:54,997 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_64 [2018-04-12 06:30:54,997 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i__append [2018-04-12 06:30:54,998 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 06:30:54,998 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 06:30:54,998 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 06:30:54,998 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 06:30:54,998 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 06:30:54,998 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 06:30:54,998 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 06:30:54,998 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 06:30:54,998 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 06:30:54,998 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 06:30:54,998 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 06:30:54,999 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 06:30:54,999 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 06:30:54,999 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 06:30:54,999 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 06:30:54,999 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 06:30:54,999 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 06:30:54,999 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 06:30:54,999 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_32 [2018-04-12 06:30:54,999 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_64 [2018-04-12 06:30:55,000 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 06:30:55,000 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 06:30:55,000 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 06:30:55,000 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 06:30:55,000 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 06:30:55,000 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 06:30:55,000 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 06:30:55,000 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 06:30:55,000 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 06:30:55,001 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 06:30:55,001 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 06:30:55,001 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 06:30:55,001 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 06:30:55,001 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 06:30:55,001 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 06:30:55,001 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 06:30:55,001 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 06:30:55,001 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 06:30:55,002 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 06:30:55,002 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 06:30:55,002 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 06:30:55,002 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 06:30:55,002 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 06:30:55,002 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 06:30:55,002 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 06:30:55,002 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 06:30:55,002 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 06:30:55,002 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 06:30:55,003 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 06:30:55,003 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 06:30:55,003 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 06:30:55,003 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 06:30:55,003 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 06:30:55,003 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 06:30:55,003 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 06:30:55,003 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 06:30:55,003 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 06:30:55,003 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 06:30:55,004 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 06:30:55,004 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 06:30:55,004 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 06:30:55,004 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 06:30:55,004 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-12 06:30:55,004 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 06:30:55,004 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 06:30:55,004 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-12 06:30:55,004 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 06:30:55,004 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 06:30:55,005 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-12 06:30:55,005 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 06:30:55,005 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 06:30:55,005 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 06:30:55,005 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 06:30:55,005 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 06:30:55,005 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 06:30:55,005 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 06:30:55,005 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 06:30:55,005 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 06:30:55,005 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 06:30:55,006 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 06:30:55,006 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 06:30:55,006 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 06:30:55,006 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 06:30:55,006 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 06:30:55,006 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 06:30:55,006 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 06:30:55,006 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 06:30:55,006 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 06:30:55,006 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 06:30:55,006 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 06:30:55,007 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 06:30:55,007 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 06:30:55,007 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 06:30:55,007 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 06:30:55,007 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 06:30:55,007 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 06:30:55,007 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 06:30:55,007 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 06:30:55,007 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 06:30:55,007 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 06:30:55,008 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 06:30:55,008 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 06:30:55,008 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 06:30:55,008 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 06:30:55,008 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 06:30:55,008 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 06:30:55,008 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 06:30:55,008 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-04-12 06:30:55,008 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 06:30:55,008 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i__append [2018-04-12 06:30:55,009 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 06:30:55,009 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 06:30:55,009 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 06:30:55,009 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 06:30:55,009 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 06:30:55,009 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 06:30:55,009 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 06:30:55,009 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 06:30:55,009 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 06:30:55,009 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 06:30:55,396 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 06:30:55,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 06:30:55 BoogieIcfgContainer [2018-04-12 06:30:55,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 06:30:55,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 06:30:55,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 06:30:55,400 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 06:30:55,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 06:30:54" (1/3) ... [2018-04-12 06:30:55,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a326f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 06:30:55, skipping insertion in model container [2018-04-12 06:30:55,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:30:54" (2/3) ... [2018-04-12 06:30:55,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a326f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 06:30:55, skipping insertion in model container [2018-04-12 06:30:55,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 06:30:55" (3/3) ... [2018-04-12 06:30:55,403 INFO L107 eAbstractionObserver]: Analyzing ICFG length_test03_false-valid-memtrack.i [2018-04-12 06:30:55,411 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 06:30:55,418 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-12 06:30:55,450 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 06:30:55,451 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 06:30:55,451 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 06:30:55,451 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 06:30:55,451 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 06:30:55,451 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 06:30:55,452 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 06:30:55,452 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 06:30:55,452 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 06:30:55,452 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 06:30:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2018-04-12 06:30:55,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 06:30:55,466 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:30:55,467 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:30:55,467 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-12 06:30:55,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1465942715, now seen corresponding path program 1 times [2018-04-12 06:30:55,470 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:30:55,471 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:30:55,500 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:55,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:55,500 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:55,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:30:55,576 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-12 06:30:55,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:30:55,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:30:55,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:30:55,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:30:55,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:30:55,594 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 4 states. [2018-04-12 06:30:55,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:30:55,792 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-04-12 06:30:55,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 06:30:55,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 06:30:55,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:30:55,802 INFO L225 Difference]: With dead ends: 175 [2018-04-12 06:30:55,803 INFO L226 Difference]: Without dead ends: 172 [2018-04-12 06:30:55,804 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-12 06:30:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-12 06:30:55,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 134. [2018-04-12 06:30:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-12 06:30:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-04-12 06:30:55,843 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 8 [2018-04-12 06:30:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:30:55,843 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-04-12 06:30:55,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:30:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-04-12 06:30:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 06:30:55,844 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:30:55,844 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:30:55,844 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-12 06:30:55,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1465942716, now seen corresponding path program 1 times [2018-04-12 06:30:55,845 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:30:55,845 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:30:55,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:55,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:55,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:55,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:30:55,899 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-12 06:30:55,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:30:55,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:30:55,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:30:55,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:30:55,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:30:55,900 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 4 states. [2018-04-12 06:30:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:30:56,005 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-12 06:30:56,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 06:30:56,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 06:30:56,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:30:56,007 INFO L225 Difference]: With dead ends: 134 [2018-04-12 06:30:56,007 INFO L226 Difference]: Without dead ends: 134 [2018-04-12 06:30:56,007 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-12 06:30:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-12 06:30:56,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-04-12 06:30:56,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-12 06:30:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-04-12 06:30:56,012 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 8 [2018-04-12 06:30:56,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:30:56,013 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-04-12 06:30:56,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:30:56,013 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-04-12 06:30:56,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-12 06:30:56,013 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:30:56,013 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:30:56,013 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-12 06:30:56,013 INFO L82 PathProgramCache]: Analyzing trace with hash -643063297, now seen corresponding path program 1 times [2018-04-12 06:30:56,013 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:30:56,013 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:30:56,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:56,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:56,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:56,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:30:56,046 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-12 06:30:56,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:30:56,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:30:56,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:30:56,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:30:56,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:30:56,047 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 4 states. [2018-04-12 06:30:56,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:30:56,130 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-04-12 06:30:56,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 06:30:56,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-12 06:30:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:30:56,131 INFO L225 Difference]: With dead ends: 148 [2018-04-12 06:30:56,131 INFO L226 Difference]: Without dead ends: 148 [2018-04-12 06:30:56,132 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-12 06:30:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-12 06:30:56,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2018-04-12 06:30:56,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-12 06:30:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-04-12 06:30:56,137 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 12 [2018-04-12 06:30:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:30:56,137 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-04-12 06:30:56,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:30:56,137 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-04-12 06:30:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-12 06:30:56,137 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:30:56,137 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:30:56,137 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-12 06:30:56,138 INFO L82 PathProgramCache]: Analyzing trace with hash -643063296, now seen corresponding path program 1 times [2018-04-12 06:30:56,138 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:30:56,138 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:30:56,138 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:56,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:56,138 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:56,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:30:56,173 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-12 06:30:56,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:30:56,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:30:56,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:30:56,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:30:56,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:30:56,174 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 4 states. [2018-04-12 06:30:56,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:30:56,247 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-04-12 06:30:56,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 06:30:56,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-12 06:30:56,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:30:56,248 INFO L225 Difference]: With dead ends: 135 [2018-04-12 06:30:56,248 INFO L226 Difference]: Without dead ends: 135 [2018-04-12 06:30:56,249 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-12 06:30:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-12 06:30:56,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-04-12 06:30:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-12 06:30:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-04-12 06:30:56,253 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 12 [2018-04-12 06:30:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:30:56,253 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-04-12 06:30:56,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:30:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-04-12 06:30:56,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-12 06:30:56,254 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:30:56,254 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-12 06:30:56,254 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-12 06:30:56,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1451976942, now seen corresponding path program 1 times [2018-04-12 06:30:56,254 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:30:56,254 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:30:56,255 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:56,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:56,255 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:56,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:30:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:30:56,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:30:56,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:30:56,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:30:56,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:30:56,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:30:56,293 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 4 states. [2018-04-12 06:30:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:30:56,358 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-04-12 06:30:56,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 06:30:56,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-12 06:30:56,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:30:56,358 INFO L225 Difference]: With dead ends: 128 [2018-04-12 06:30:56,359 INFO L226 Difference]: Without dead ends: 128 [2018-04-12 06:30:56,359 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-12 06:30:56,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-12 06:30:56,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-04-12 06:30:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-12 06:30:56,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-04-12 06:30:56,363 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 20 [2018-04-12 06:30:56,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:30:56,363 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-04-12 06:30:56,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:30:56,364 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-04-12 06:30:56,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-12 06:30:56,364 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:30:56,364 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-12 06:30:56,364 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-12 06:30:56,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1451976941, now seen corresponding path program 1 times [2018-04-12 06:30:56,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:30:56,364 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:30:56,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:56,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:56,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:56,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:30:56,416 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-12 06:30:56,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:30:56,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:30:56,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:30:56,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:30:56,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:30:56,417 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 4 states. [2018-04-12 06:30:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:30:56,462 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-04-12 06:30:56,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 06:30:56,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-12 06:30:56,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:30:56,463 INFO L225 Difference]: With dead ends: 123 [2018-04-12 06:30:56,463 INFO L226 Difference]: Without dead ends: 123 [2018-04-12 06:30:56,463 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-12 06:30:56,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-12 06:30:56,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-04-12 06:30:56,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-12 06:30:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-04-12 06:30:56,467 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 20 [2018-04-12 06:30:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:30:56,467 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-04-12 06:30:56,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:30:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-04-12 06:30:56,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 06:30:56,467 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:30:56,468 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-12 06:30:56,468 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-12 06:30:56,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2061612264, now seen corresponding path program 1 times [2018-04-12 06:30:56,468 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:30:56,468 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:30:56,468 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:56,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:56,469 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:56,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:30:56,486 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:30:56,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:30:56,487 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:30:56,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:56,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:30:56,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:30:56,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:56,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:56,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 06:30:56,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:56,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:56,571 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-12 06:30:56,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:56,578 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-12 06:30:56,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-12 06:30:56,629 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-12 06:30:56,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:56,636 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-12 06:30:56,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-04-12 06:30:56,645 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-12 06:30:56,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:30:56,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 06:30:56,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 06:30:56,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 06:30:56,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-12 06:30:56,647 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 7 states. [2018-04-12 06:30:56,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:30:56,905 INFO L93 Difference]: Finished difference Result 238 states and 254 transitions. [2018-04-12 06:30:56,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 06:30:56,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-04-12 06:30:56,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:30:56,906 INFO L225 Difference]: With dead ends: 238 [2018-04-12 06:30:56,906 INFO L226 Difference]: Without dead ends: 238 [2018-04-12 06:30:56,907 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-12 06:30:56,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-12 06:30:56,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 150. [2018-04-12 06:30:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-12 06:30:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2018-04-12 06:30:56,910 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 21 [2018-04-12 06:30:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:30:56,911 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2018-04-12 06:30:56,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 06:30:56,911 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2018-04-12 06:30:56,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 06:30:56,911 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:30:56,911 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-12 06:30:56,911 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-12 06:30:56,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2061612263, now seen corresponding path program 1 times [2018-04-12 06:30:56,911 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:30:56,911 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:30:56,912 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:56,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:56,912 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:56,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:30:56,925 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:30:56,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:30:56,931 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:30:56,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:56,963 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:30:56,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:30:56,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:56,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:30:56,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:56,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:56,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-12 06:30:57,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:57,005 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-12 06:30:57,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:57,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:57,017 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-12 06:30:57,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,023 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-12 06:30:57,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-12 06:30:57,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:57,076 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-12 06:30:57,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-12 06:30:57,104 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-12 06:30:57,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:69 [2018-04-12 06:30:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:30:57,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:30:57,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 06:30:57,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 06:30:57,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 06:30:57,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-12 06:30:57,151 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand 9 states. [2018-04-12 06:30:57,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:30:57,453 INFO L93 Difference]: Finished difference Result 178 states and 200 transitions. [2018-04-12 06:30:57,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 06:30:57,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-12 06:30:57,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:30:57,454 INFO L225 Difference]: With dead ends: 178 [2018-04-12 06:30:57,454 INFO L226 Difference]: Without dead ends: 178 [2018-04-12 06:30:57,454 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-12 06:30:57,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-12 06:30:57,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-04-12 06:30:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-12 06:30:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2018-04-12 06:30:57,459 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 21 [2018-04-12 06:30:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:30:57,460 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2018-04-12 06:30:57,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 06:30:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2018-04-12 06:30:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 06:30:57,460 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:30:57,460 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-12 06:30:57,460 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-12 06:30:57,461 INFO L82 PathProgramCache]: Analyzing trace with hash 945598509, now seen corresponding path program 1 times [2018-04-12 06:30:57,461 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:30:57,461 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:30:57,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:57,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:57,462 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:57,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:30:57,482 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:30:57,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:30:57,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:30:57,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:57,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:30:57,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:30:57,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:30:57,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 06:30:57,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:30:57,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,565 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-12 06:30:57,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 06:30:57,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,574 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:26 [2018-04-12 06:30:57,583 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-12 06:30:57,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:57,585 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-12 06:30:57,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,598 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-12 06:30:57,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:57,601 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-12 06:30:57,601 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,610 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-12 06:30:57,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:57,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:57,624 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-12 06:30:57,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:53 [2018-04-12 06:30:57,664 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-12 06:30:57,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:30:57,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,683 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-12 06:30:57,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:30:57,685 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-04-12 06:30:57,721 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-12 06:30:57,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:57,724 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-12 06:30:57,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,748 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-12 06:30:57,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:57,752 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-12 06:30:57,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,771 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-12 06:30:57,771 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:85 [2018-04-12 06:30:57,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:57,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:57,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:57,890 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-12 06:30:57,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:57,911 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-12 06:30:57,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:90, output treesize:83 [2018-04-12 06:30:57,990 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-12 06:30:58,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:58,010 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-12 06:30:58,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:58,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:58,016 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-12 06:30:58,017 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:58,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:58,031 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-12 06:30:58,031 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:97, output treesize:61 [2018-04-12 06:30:58,085 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-12 06:30:58,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:30:58,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-12 06:30:58,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 06:30:58,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 06:30:58,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-04-12 06:30:58,086 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 16 states. [2018-04-12 06:30:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:30:59,153 INFO L93 Difference]: Finished difference Result 178 states and 199 transitions. [2018-04-12 06:30:59,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 06:30:59,154 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-04-12 06:30:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:30:59,155 INFO L225 Difference]: With dead ends: 178 [2018-04-12 06:30:59,155 INFO L226 Difference]: Without dead ends: 178 [2018-04-12 06:30:59,155 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-12 06:30:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-12 06:30:59,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-04-12 06:30:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-12 06:30:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 199 transitions. [2018-04-12 06:30:59,159 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 199 transitions. Word has length 30 [2018-04-12 06:30:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:30:59,160 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 199 transitions. [2018-04-12 06:30:59,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 06:30:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 199 transitions. [2018-04-12 06:30:59,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 06:30:59,160 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:30:59,160 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-12 06:30:59,161 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-12 06:30:59,161 INFO L82 PathProgramCache]: Analyzing trace with hash 548364848, now seen corresponding path program 1 times [2018-04-12 06:30:59,161 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:30:59,161 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:30:59,162 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:59,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:59,162 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:59,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:30:59,181 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:30:59,181 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:30:59,182 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:30:59,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:59,224 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:30:59,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:30:59,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:30:59,246 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-12 06:30:59,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:30:59,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,263 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-12 06:30:59,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:30:59,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-12 06:30:59,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:59,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:59,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-12 06:30:59,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:36 [2018-04-12 06:30:59,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 21 treesize of output 22 [2018-04-12 06:30:59,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-12 06:30:59,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,353 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-12 06:30:59,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:30:59,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,369 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-04-12 06:30:59,394 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-12 06:30:59,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:59,398 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-12 06:30:59,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,426 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-12 06:30:59,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:59,430 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-12 06:30:59,431 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,451 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-12 06:30:59,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:68 [2018-04-12 06:30:59,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:59,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:59,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:59,524 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-12 06:30:59,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 06:30:59,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:59,551 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-12 06:30:59,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:75, output treesize:67 [2018-04-12 06:30:59,795 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-12 06:30:59,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:30:59,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-12 06:30:59,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 06:30:59,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 06:30:59,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=194, Unknown=2, NotChecked=0, Total=240 [2018-04-12 06:30:59,796 INFO L87 Difference]: Start difference. First operand 176 states and 199 transitions. Second operand 16 states. [2018-04-12 06:31:00,059 WARN L148 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-12 06:31:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:31:00,788 INFO L93 Difference]: Finished difference Result 168 states and 188 transitions. [2018-04-12 06:31:00,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 06:31:00,789 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-04-12 06:31:00,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:31:00,789 INFO L225 Difference]: With dead ends: 168 [2018-04-12 06:31:00,789 INFO L226 Difference]: Without dead ends: 168 [2018-04-12 06:31:00,790 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-12 06:31:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-12 06:31:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-04-12 06:31:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-12 06:31:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2018-04-12 06:31:00,792 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 32 [2018-04-12 06:31:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:31:00,793 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2018-04-12 06:31:00,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 06:31:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2018-04-12 06:31:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-12 06:31:00,793 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:31:00,794 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-12 06:31:00,794 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-12 06:31:00,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1767154905, now seen corresponding path program 1 times [2018-04-12 06:31:00,794 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:31:00,794 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:31:00,795 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:00,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:00,795 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:00,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:31:00,831 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-12 06:31:00,832 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:31:00,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:31:00,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 06:31:00,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 06:31:00,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 06:31:00,832 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 3 states. [2018-04-12 06:31:00,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:31:00,845 INFO L93 Difference]: Finished difference Result 177 states and 194 transitions. [2018-04-12 06:31:00,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 06:31:00,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-04-12 06:31:00,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:31:00,847 INFO L225 Difference]: With dead ends: 177 [2018-04-12 06:31:00,847 INFO L226 Difference]: Without dead ends: 177 [2018-04-12 06:31:00,847 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-12 06:31:00,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-12 06:31:00,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2018-04-12 06:31:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-12 06:31:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2018-04-12 06:31:00,851 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 38 [2018-04-12 06:31:00,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:31:00,851 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2018-04-12 06:31:00,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 06:31:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2018-04-12 06:31:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-12 06:31:00,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:31:00,852 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-12 06:31:00,852 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-12 06:31:00,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1625593294, now seen corresponding path program 1 times [2018-04-12 06:31:00,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:31:00,853 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:31:00,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:00,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:00,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:00,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:31:00,873 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:31:00,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:31:00,874 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:31:00,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:00,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:31:00,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:00,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:00,969 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-12 06:31:00,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:00,977 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-12 06:31:00,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:00,983 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-12 06:31:00,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-12 06:31:01,002 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-12 06:31:01,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:31:01,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-12 06:31:01,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 06:31:01,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 06:31:01,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-12 06:31:01,003 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand 10 states. [2018-04-12 06:31:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:31:01,343 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-04-12 06:31:01,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 06:31:01,343 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-04-12 06:31:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:31:01,347 INFO L225 Difference]: With dead ends: 177 [2018-04-12 06:31:01,348 INFO L226 Difference]: Without dead ends: 177 [2018-04-12 06:31:01,348 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-12 06:31:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-12 06:31:01,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2018-04-12 06:31:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-12 06:31:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-04-12 06:31:01,351 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 41 [2018-04-12 06:31:01,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:31:01,352 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-04-12 06:31:01,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 06:31:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-04-12 06:31:01,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 06:31:01,352 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:31:01,353 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-12 06:31:01,353 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-12 06:31:01,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1911230466, now seen corresponding path program 1 times [2018-04-12 06:31:01,353 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:31:01,353 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:31:01,353 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:01,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:01,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:01,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:31:01,368 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:31:01,368 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:31:01,369 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:31:01,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:01,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:31:01,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:01,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:01,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:01,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 06:31:01,413 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-12 06:31:01,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:01,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:01,425 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-12 06:31:01,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:01,430 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-12 06:31:01,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-12 06:31:01,457 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-12 06:31:01,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:01,461 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-12 06:31:01,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-04-12 06:31:01,472 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-12 06:31:01,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:31:01,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-12 06:31:01,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 06:31:01,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 06:31:01,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2018-04-12 06:31:01,473 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 9 states. [2018-04-12 06:31:01,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:31:01,760 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2018-04-12 06:31:01,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 06:31:01,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-04-12 06:31:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:31:01,763 INFO L225 Difference]: With dead ends: 275 [2018-04-12 06:31:01,763 INFO L226 Difference]: Without dead ends: 275 [2018-04-12 06:31:01,763 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2018-04-12 06:31:01,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-12 06:31:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 213. [2018-04-12 06:31:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-12 06:31:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 244 transitions. [2018-04-12 06:31:01,767 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 244 transitions. Word has length 43 [2018-04-12 06:31:01,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:31:01,767 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 244 transitions. [2018-04-12 06:31:01,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 06:31:01,767 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 244 transitions. [2018-04-12 06:31:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 06:31:01,768 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:31:01,768 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-12 06:31:01,768 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-12 06:31:01,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1911230465, now seen corresponding path program 1 times [2018-04-12 06:31:01,768 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:31:01,769 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:31:01,769 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:01,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:01,770 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:01,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:31:01,792 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:31:01,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:31:01,792 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:31:01,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:01,831 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:31:01,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:01,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:01,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:01,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:01,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:01,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-12 06:31:02,052 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-12 06:31:02,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:02,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:02,081 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-12 06:31:02,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:02,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:02,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:02,091 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-12 06:31:02,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:02,096 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-12 06:31:02,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-12 06:31:02,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:02,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:02,137 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-12 06:31:02,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-12 06:31:02,150 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-12 06:31:02,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:44 [2018-04-12 06:31:02,185 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-12 06:31:02,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:31:02,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 06:31:02,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 06:31:02,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 06:31:02,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2018-04-12 06:31:02,186 INFO L87 Difference]: Start difference. First operand 213 states and 244 transitions. Second operand 11 states. [2018-04-12 06:31:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:31:02,681 INFO L93 Difference]: Finished difference Result 268 states and 313 transitions. [2018-04-12 06:31:02,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 06:31:02,682 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-04-12 06:31:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:31:02,683 INFO L225 Difference]: With dead ends: 268 [2018-04-12 06:31:02,683 INFO L226 Difference]: Without dead ends: 268 [2018-04-12 06:31:02,684 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-12 06:31:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-12 06:31:02,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 243. [2018-04-12 06:31:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-12 06:31:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 279 transitions. [2018-04-12 06:31:02,689 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 279 transitions. Word has length 43 [2018-04-12 06:31:02,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:31:02,690 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 279 transitions. [2018-04-12 06:31:02,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 06:31:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 279 transitions. [2018-04-12 06:31:02,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 06:31:02,691 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:31:02,691 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-12 06:31:02,691 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-12 06:31:02,691 INFO L82 PathProgramCache]: Analyzing trace with hash 771137816, now seen corresponding path program 1 times [2018-04-12 06:31:02,691 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:31:02,691 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:31:02,692 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:02,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:02,692 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:02,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:31:02,714 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:31:02,714 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:31:02,714 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:31:02,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:02,772 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:31:02,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:02,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:02,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:02,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:31:02,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:02,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:02,795 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-12 06:31:02,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:02,799 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-12 06:31:02,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-04-12 06:31:02,864 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-12 06:31:02,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:02,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:02,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:02,873 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-12 06:31:02,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-04-12 06:31:02,896 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-12 06:31:02,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:02,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:02,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:02,917 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-12 06:31:02,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-04-12 06:31:02,964 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-12 06:31:02,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:02,968 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-12 06:31:02,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:02,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:02,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:02,996 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-12 06:31:02,996 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 06:31:03,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:31:03,030 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-12 06:31:03,031 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:76, output treesize:107 [2018-04-12 06:31:03,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:03,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:03,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:03,069 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-12 06:31:03,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:03,103 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-12 06:31:03,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:141, output treesize:91 [2018-04-12 06:31:03,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:03,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:03,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:03,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:03,203 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-12 06:31:03,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:03,231 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-12 06:31:03,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:102, output treesize:114 [2018-04-12 06:31:03,324 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-12 06:31:03,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:03,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:03,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:03,370 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-12 06:31:03,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:127, output treesize:114 [2018-04-12 06:31:03,433 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-12 06:31:03,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 10 treesize of output 9 [2018-04-12 06:31:03,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:03,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:03,473 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-12 06:31:03,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:127, output treesize:123 [2018-04-12 06:31:03,559 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-12 06:31:03,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:03,562 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-12 06:31:03,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:03,572 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:03,573 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-12 06:31:03,573 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:03,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 06:31:03,580 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:03,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:03,600 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-12 06:31:03,600 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:132, output treesize:45 [2018-04-12 06:31:03,636 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-12 06:31:03,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:31:03,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-12 06:31:03,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 06:31:03,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 06:31:03,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-04-12 06:31:03,637 INFO L87 Difference]: Start difference. First operand 243 states and 279 transitions. Second operand 21 states. [2018-04-12 06:31:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:31:05,358 INFO L93 Difference]: Finished difference Result 312 states and 360 transitions. [2018-04-12 06:31:05,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-12 06:31:05,358 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-04-12 06:31:05,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:31:05,359 INFO L225 Difference]: With dead ends: 312 [2018-04-12 06:31:05,359 INFO L226 Difference]: Without dead ends: 312 [2018-04-12 06:31:05,360 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=1199, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 06:31:05,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-04-12 06:31:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 265. [2018-04-12 06:31:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-12 06:31:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 309 transitions. [2018-04-12 06:31:05,365 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 309 transitions. Word has length 50 [2018-04-12 06:31:05,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:31:05,365 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 309 transitions. [2018-04-12 06:31:05,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 06:31:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 309 transitions. [2018-04-12 06:31:05,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 06:31:05,366 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:31:05,366 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-12 06:31:05,366 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-12 06:31:05,366 INFO L82 PathProgramCache]: Analyzing trace with hash 771137817, now seen corresponding path program 1 times [2018-04-12 06:31:05,366 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:31:05,366 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:31:05,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:05,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:05,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:05,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:31:05,390 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:31:05,391 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:31:05,391 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:31:05,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:05,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:31:05,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:05,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:05,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:05,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:31:05,451 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-12 06:31:05,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:05,455 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-12 06:31:05,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-12 06:31:05,696 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:05,696 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-12 06:31:05,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:05,699 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-12 06:31:05,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:05,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:05,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:05,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:42 [2018-04-12 06:31:05,729 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:05,730 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-12 06:31:05,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:05,732 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-12 06:31:05,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:05,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:05,746 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-12 06:31:05,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:05,748 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:05,749 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:05,761 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-12 06:31:05,761 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:48 [2018-04-12 06:31:05,796 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-12 06:31:05,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:05,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:05,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:05,833 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-12 06:31:05,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:05,835 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:05,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:05,870 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-12 06:31:05,871 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:72 [2018-04-12 06:31:05,931 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-12 06:31:05,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:05,935 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-12 06:31:05,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:05,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:05,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:05,984 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-12 06:31:05,985 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 06:31:06,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:31:06,062 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:06,062 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-12 06:31:06,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:06,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:06,069 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:06,070 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-12 06:31:06,070 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:06,081 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:06,096 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-12 06:31:06,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:06,100 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-12 06:31:06,100 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:06,167 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:06,197 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-12 06:31:06,197 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:177, output treesize:220 [2018-04-12 06:31:06,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:06,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:06,239 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-12 06:31:06,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:06,279 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-12 06:31:06,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:236, output treesize:159 [2018-04-12 06:31:06,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:06,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:06,368 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-12 06:31:06,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:06,391 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-12 06:31:06,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:06,418 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-12 06:31:06,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:173, output treesize:166 [2018-04-12 06:31:06,646 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-12 06:31:06,656 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:06,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:06,658 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-12 06:31:06,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:06,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:06,829 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:06,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:06,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:06,918 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:06,921 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-12 06:31:06,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:07,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:31:07,084 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-12 06:31:07,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:07,091 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:07,093 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-12 06:31:07,094 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:07,111 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:07,138 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-12 06:31:07,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:07,145 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:07,147 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-12 06:31:07,147 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:07,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:07,287 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:07,410 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:31:07,457 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-12 06:31:07,457 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:198, output treesize:324 [2018-04-12 06:31:07,582 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-12 06:31:07,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 06:31:07,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:07,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:07,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, 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-12 06:31:07,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:07,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:07,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:07,905 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:07,906 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-12 06:31:07,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:08,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:08,014 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:08,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:08,120 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:08,122 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-12 06:31:08,124 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:08,124 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-12 06:31:08,124 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:08,142 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:08,191 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:08,193 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-12 06:31:08,195 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:08,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:08,199 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-12 06:31:08,199 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:08,218 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:08,258 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-12 06:31:08,258 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:393, output treesize:332 [2018-04-12 06:31:08,357 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-12 06:31:08,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:08,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:08,362 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:08,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:08,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:08,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:08,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:08,364 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:08,365 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:08,365 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-12 06:31:08,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:08,455 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:08,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 06:31:08,456 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:08,533 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:08,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:08,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:08,537 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-12 06:31:08,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:08,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:08,613 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-12 06:31:08,613 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:08,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:31:08,897 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-12 06:31:08,898 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:08,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 77 treesize of output 97 [2018-04-12 06:31:08,899 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:08,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:08,920 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-12 06:31:08,921 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:08,950 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:09,012 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-12 06:31:09,013 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-12 06:31:09,013 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:09,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:09,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:09,025 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:09,025 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-12 06:31:09,026 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:09,034 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:09,095 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-12 06:31:09,097 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:09,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:09,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:09,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:09,099 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:09,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, 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-12 06:31:09,100 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:09,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:09,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 06:31:09,139 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:09,170 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:09,180 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-12 06:31:09,183 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:09,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:09,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:09,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:09,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:09,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:09,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:09,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:09,186 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:09,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:09,188 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:09,188 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-12 06:31:09,188 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:09,268 INFO L267 ElimStorePlain]: Start of recursive call 16: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:09,295 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-12 06:31:09,295 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 13 variables, input treesize:366, output treesize:69 [2018-04-12 06:31:09,366 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-12 06:31:09,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:31:09,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-12 06:31:09,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-12 06:31:09,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-12 06:31:09,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=626, Unknown=1, NotChecked=0, Total=702 [2018-04-12 06:31:09,367 INFO L87 Difference]: Start difference. First operand 265 states and 309 transitions. Second operand 27 states. [2018-04-12 06:31:40,913 WARN L151 SmtUtils]: Spent 257ms on a formula simplification. DAG size of input: 138 DAG size of output 129 [2018-04-12 06:31:41,289 WARN L151 SmtUtils]: Spent 296ms on a formula simplification. DAG size of input: 152 DAG size of output 143 [2018-04-12 06:31:50,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:31:50,101 INFO L93 Difference]: Finished difference Result 323 states and 378 transitions. [2018-04-12 06:31:50,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-12 06:31:50,101 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2018-04-12 06:31:50,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:31:50,103 INFO L225 Difference]: With dead ends: 323 [2018-04-12 06:31:50,103 INFO L226 Difference]: Without dead ends: 323 [2018-04-12 06:31:50,104 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=419, Invalid=2332, Unknown=5, NotChecked=0, Total=2756 [2018-04-12 06:31:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-12 06:31:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 288. [2018-04-12 06:31:50,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-04-12 06:31:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 337 transitions. [2018-04-12 06:31:50,110 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 337 transitions. Word has length 50 [2018-04-12 06:31:50,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:31:50,111 INFO L459 AbstractCegarLoop]: Abstraction has 288 states and 337 transitions. [2018-04-12 06:31:50,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-12 06:31:50,111 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 337 transitions. [2018-04-12 06:31:50,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 06:31:50,112 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:31:50,112 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-12 06:31:50,112 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-12 06:31:50,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1788489223, now seen corresponding path program 1 times [2018-04-12 06:31:50,112 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:31:50,112 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:31:50,113 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:50,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:50,113 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:50,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:31:50,131 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:31:50,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:31:50,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:31:50,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:50,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:31:50,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:50,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 06:31:50,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:50,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:50,193 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-12 06:31:50,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-12 06:31:50,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, 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-12 06:31:50,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-12 06:31:50,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,239 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-12 06:31:50,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 06:31:50,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,249 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-12 06:31:50,273 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-12 06:31:50,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:50,276 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-12 06:31:50,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,295 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-12 06:31:50,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:50,298 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-12 06:31:50,298 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,324 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-04-12 06:31:50,488 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-12 06:31:50,611 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 77 DAG size of output 61 [2018-04-12 06:31:50,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:50,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:50,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:50,620 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-12 06:31:50,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,727 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-12 06:31:50,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:50,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:50,734 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-12 06:31:50,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,764 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-12 06:31:50,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:50,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:50,771 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-12 06:31:50,771 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,778 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,789 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,799 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-12 06:31:50,836 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-12 06:31:50,838 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-12 06:31:50,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:50,841 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-12 06:31:50,841 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,845 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,861 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-12 06:31:50,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:31:50,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:50,865 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-12 06:31:50,865 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,869 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,877 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:50,884 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-12 06:31:50,907 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-12 06:31:50,907 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:152, output treesize:194 [2018-04-12 06:31:51,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:51,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:51,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:51,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:51,025 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-12 06:31:51,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:51,050 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-12 06:31:51,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:202, output treesize:194 [2018-04-12 06:32:13,284 WARN L148 SmtUtils]: Spent 2742ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-12 06:32:33,586 WARN L148 SmtUtils]: Spent 2704ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-12 06:32:43,093 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-12 06:32:43,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:32:43,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-12 06:32:43,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-12 06:32:43,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-12 06:32:43,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=391, Unknown=24, NotChecked=40, Total=506 [2018-04-12 06:32:43,094 INFO L87 Difference]: Start difference. First operand 288 states and 337 transitions. Second operand 23 states. [2018-04-12 06:34:01,633 WARN L151 SmtUtils]: Spent 9586ms on a formula simplification. DAG size of input: 131 DAG size of output 123 [2018-04-12 06:34:11,402 WARN L151 SmtUtils]: Spent 9592ms on a formula simplification. DAG size of input: 144 DAG size of output 126 [2018-04-12 06:34:20,925 WARN L151 SmtUtils]: Spent 9417ms on a formula simplification. DAG size of input: 153 DAG size of output 135 [2018-04-12 06:34:35,910 WARN L151 SmtUtils]: Spent 9444ms on a formula simplification. DAG size of input: 213 DAG size of output 136 [2018-04-12 06:35:07,093 WARN L148 SmtUtils]: Spent 5404ms on a formula simplification that was a NOOP. DAG size: 73 [2018-04-12 06:35:36,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:35:36,195 INFO L93 Difference]: Finished difference Result 326 states and 373 transitions. [2018-04-12 06:35:36,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 06:35:36,195 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-04-12 06:35:36,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:35:36,196 INFO L225 Difference]: With dead ends: 326 [2018-04-12 06:35:36,196 INFO L226 Difference]: Without dead ends: 326 [2018-04-12 06:35:36,197 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 123.5s TimeCoverageRelationStatistics Valid=155, Invalid=997, Unknown=42, NotChecked=66, Total=1260 [2018-04-12 06:35:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-04-12 06:35:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 288. [2018-04-12 06:35:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-04-12 06:35:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 336 transitions. [2018-04-12 06:35:36,203 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 336 transitions. Word has length 52 [2018-04-12 06:35:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:35:36,204 INFO L459 AbstractCegarLoop]: Abstraction has 288 states and 336 transitions. [2018-04-12 06:35:36,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-12 06:35:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 336 transitions. [2018-04-12 06:35:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-12 06:35:36,204 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:35:36,204 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:35:36,205 INFO L408 AbstractCegarLoop]: === Iteration 18 === [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-12 06:35:36,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1182477942, now seen corresponding path program 1 times [2018-04-12 06:35:36,205 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:35:36,205 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:35:36,205 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:35:36,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:35:36,206 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:35:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:35:36,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:35:36,227 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:35:36,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:35:36,227 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:35:36,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:35:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:35:36,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:35:36,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:35:36,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:35:36,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:36,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:36,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 06:35:36,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-12 06:35:36,324 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 13 treesize of output 10 [2018-04-12 06:35:36,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 10 treesize of output 9 [2018-04-12 06:35:36,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,333 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 13 treesize of output 10 [2018-04-12 06:35:36,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:35:36,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,341 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-12 06:35:36,486 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-12 06:35:36,592 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 72 DAG size of output 56 [2018-04-12 06:35:36,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:36,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:36,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:36,598 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-12 06:35:36,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,645 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 41 treesize of output 53 [2018-04-12 06:35:36,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:35:36,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:36,650 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-12 06:35:36,651 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,680 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 44 treesize of output 53 [2018-04-12 06:35:36,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:35:36,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:36,685 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-12 06:35:36,685 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,691 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,701 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,709 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-12 06:35:36,741 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 41 treesize of output 53 [2018-04-12 06:35:36,743 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-12 06:35:36,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:36,745 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-12 06:35:36,745 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,750 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,765 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 44 treesize of output 53 [2018-04-12 06:35:36,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:35:36,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:36,769 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-12 06:35:36,769 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,773 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,781 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,787 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-12 06:35:36,809 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-12 06:35:36,809 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:135, output treesize:177 [2018-04-12 06:35:36,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:36,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:36,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:36,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:36,958 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-12 06:35:36,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:36,980 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-12 06:35:36,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:178, output treesize:170 [2018-04-12 06:35:39,765 WARN L148 SmtUtils]: Spent 2755ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-12 06:35:42,853 WARN L148 SmtUtils]: Spent 2760ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-12 06:35:45,643 WARN L148 SmtUtils]: Spent 2751ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-12 06:35:54,007 WARN L151 SmtUtils]: Spent 8317ms on a formula simplification. DAG size of input: 66 DAG size of output 56 [2018-04-12 06:35:54,021 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-12 06:35:54,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:35:54,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-12 06:35:54,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-12 06:35:54,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-12 06:35:54,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=407, Unknown=8, NotChecked=40, Total=506 [2018-04-12 06:35:54,022 INFO L87 Difference]: Start difference. First operand 288 states and 336 transitions. Second operand 23 states. [2018-04-12 06:36:04,557 WARN L151 SmtUtils]: Spent 9475ms on a formula simplification. DAG size of input: 115 DAG size of output 101 [2018-04-12 06:36:12,518 WARN L151 SmtUtils]: Spent 7912ms on a formula simplification. DAG size of input: 128 DAG size of output 104 [2018-04-12 06:36:22,157 WARN L151 SmtUtils]: Spent 9553ms on a formula simplification. DAG size of input: 131 DAG size of output 105 [2018-04-12 06:36:30,140 WARN L151 SmtUtils]: Spent 7915ms on a formula simplification. DAG size of input: 136 DAG size of output 112 [2018-04-12 06:36:42,484 WARN L151 SmtUtils]: Spent 12215ms on a formula simplification. DAG size of input: 131 DAG size of output 117 [2018-04-12 06:36:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:36:42,969 INFO L93 Difference]: Finished difference Result 314 states and 360 transitions. [2018-04-12 06:36:42,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-12 06:36:42,969 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-04-12 06:36:42,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:36:42,970 INFO L225 Difference]: With dead ends: 314 [2018-04-12 06:36:42,970 INFO L226 Difference]: Without dead ends: 314 [2018-04-12 06:36:42,970 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 65.1s TimeCoverageRelationStatistics Valid=147, Invalid=961, Unknown=18, NotChecked=64, Total=1190 [2018-04-12 06:36:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-12 06:36:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 280. [2018-04-12 06:36:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-04-12 06:36:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 325 transitions. [2018-04-12 06:36:42,975 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 325 transitions. Word has length 54 [2018-04-12 06:36:42,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:36:42,976 INFO L459 AbstractCegarLoop]: Abstraction has 280 states and 325 transitions. [2018-04-12 06:36:42,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-12 06:36:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 325 transitions. [2018-04-12 06:36:42,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-12 06:36:42,976 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:36:42,976 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:36:42,976 INFO L408 AbstractCegarLoop]: === Iteration 19 === [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-12 06:36:42,976 INFO L82 PathProgramCache]: Analyzing trace with hash -298162330, now seen corresponding path program 1 times [2018-04-12 06:36:42,976 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:36:42,976 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:36:42,977 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:42,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:42,977 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:42,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:36:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-04-12 06:36:43,028 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:36:43,028 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:36:43,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:43,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:36:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-04-12 06:36:43,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 06:36:43,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-04-12 06:36:43,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 06:36:43,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 06:36:43,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:36:43,054 INFO L87 Difference]: Start difference. First operand 280 states and 325 transitions. Second operand 5 states. [2018-04-12 06:36:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:36:43,077 INFO L93 Difference]: Finished difference Result 316 states and 365 transitions. [2018-04-12 06:36:43,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 06:36:43,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-04-12 06:36:43,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:36:43,079 INFO L225 Difference]: With dead ends: 316 [2018-04-12 06:36:43,079 INFO L226 Difference]: Without dead ends: 316 [2018-04-12 06:36:43,079 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:36:43,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-04-12 06:36:43,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 297. [2018-04-12 06:36:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-12 06:36:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 348 transitions. [2018-04-12 06:36:43,086 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 348 transitions. Word has length 58 [2018-04-12 06:36:43,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:36:43,086 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 348 transitions. [2018-04-12 06:36:43,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 06:36:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 348 transitions. [2018-04-12 06:36:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-12 06:36:43,087 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:36:43,087 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:36:43,088 INFO L408 AbstractCegarLoop]: === Iteration 20 === [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-12 06:36:43,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1031327766, now seen corresponding path program 1 times [2018-04-12 06:36:43,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:36:43,088 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:36:43,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:43,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:43,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:43,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:36:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-12 06:36:43,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:36:43,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:36:43,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 06:36:43,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 06:36:43,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 06:36:43,116 INFO L87 Difference]: Start difference. First operand 297 states and 348 transitions. Second operand 3 states. [2018-04-12 06:36:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:36:43,123 INFO L93 Difference]: Finished difference Result 293 states and 338 transitions. [2018-04-12 06:36:43,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 06:36:43,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-04-12 06:36:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:36:43,125 INFO L225 Difference]: With dead ends: 293 [2018-04-12 06:36:43,125 INFO L226 Difference]: Without dead ends: 293 [2018-04-12 06:36:43,125 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-12 06:36:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-12 06:36:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-04-12 06:36:43,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-12 06:36:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 338 transitions. [2018-04-12 06:36:43,131 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 338 transitions. Word has length 61 [2018-04-12 06:36:43,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:36:43,132 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 338 transitions. [2018-04-12 06:36:43,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 06:36:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 338 transitions. [2018-04-12 06:36:43,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-12 06:36:43,132 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:36:43,133 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:36:43,133 INFO L408 AbstractCegarLoop]: === Iteration 21 === [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-12 06:36:43,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1293139346, now seen corresponding path program 1 times [2018-04-12 06:36:43,133 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:36:43,133 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:36:43,134 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:43,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:43,134 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:43,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:36:43,152 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:36:43,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:36:43,152 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:36:43,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:43,191 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:36:43,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:43,270 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-12 06:36:43,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:43,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:43,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:43,283 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-12 06:36:43,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:43,290 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-12 06:36:43,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-12 06:36:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-12 06:36:43,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:36:43,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-12 06:36:43,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 06:36:43,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 06:36:43,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-12 06:36:43,313 INFO L87 Difference]: Start difference. First operand 293 states and 338 transitions. Second operand 10 states. [2018-04-12 06:36:43,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:36:43,623 INFO L93 Difference]: Finished difference Result 376 states and 422 transitions. [2018-04-12 06:36:43,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 06:36:43,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-04-12 06:36:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:36:43,624 INFO L225 Difference]: With dead ends: 376 [2018-04-12 06:36:43,624 INFO L226 Difference]: Without dead ends: 376 [2018-04-12 06:36:43,624 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-12 06:36:43,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-04-12 06:36:43,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 346. [2018-04-12 06:36:43,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-12 06:36:43,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 405 transitions. [2018-04-12 06:36:43,629 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 405 transitions. Word has length 63 [2018-04-12 06:36:43,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:36:43,629 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 405 transitions. [2018-04-12 06:36:43,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 06:36:43,629 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 405 transitions. [2018-04-12 06:36:43,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-12 06:36:43,629 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:36:43,629 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:36:43,629 INFO L408 AbstractCegarLoop]: === Iteration 22 === [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-12 06:36:43,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2092504308, now seen corresponding path program 1 times [2018-04-12 06:36:43,630 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:36:43,630 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:36:43,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:43,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:43,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:43,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:36:43,642 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:36:43,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:36:43,642 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:36:43,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:43,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:36:43,761 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-12 06:36:43,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-12 06:36:43,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:43,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:43,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:43,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-12 06:36:43,796 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-12 06:36:43,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:43,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-12 06:36:43,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:43,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:43,814 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-12 06:36:43,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-04-12 06:36:43,852 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2018-04-12 06:36:43,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 31 treesize of output 30 [2018-04-12 06:36:43,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:43,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:43,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:43,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 53 [2018-04-12 06:36:43,931 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-12 06:36:43,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 06:36:44,003 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 3 xjuncts. [2018-04-12 06:36:44,003 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:43, output treesize:116 [2018-04-12 06:36:44,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:44,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-04-12 06:36:44,097 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 33 treesize of output 31 [2018-04-12 06:36:44,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,145 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 44 treesize of output 37 [2018-04-12 06:36:44,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:44,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:44,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:44,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:44,149 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 25 treesize of output 68 [2018-04-12 06:36:44,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,203 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 66 [2018-04-12 06:36:44,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:44,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:44,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:44,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 91 [2018-04-12 06:36:44,221 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 06:36:44,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:44,274 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 54 treesize of output 67 [2018-04-12 06:36:44,274 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,296 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:36:44,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-04-12 06:36:44,333 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:162, output treesize:185 [2018-04-12 06:36:45,643 WARN L148 SmtUtils]: Spent 1268ms on a formula simplification that was a NOOP. DAG size: 78 [2018-04-12 06:36:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:36:45,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:36:45,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-12 06:36:45,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 06:36:45,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 06:36:45,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=394, Unknown=2, NotChecked=0, Total=462 [2018-04-12 06:36:45,895 INFO L87 Difference]: Start difference. First operand 346 states and 405 transitions. Second operand 22 states. [2018-04-12 06:36:47,372 WARN L151 SmtUtils]: Spent 900ms on a formula simplification. DAG size of input: 58 DAG size of output 57 [2018-04-12 06:36:51,540 WARN L151 SmtUtils]: Spent 4127ms on a formula simplification. DAG size of input: 96 DAG size of output 95 [2018-04-12 06:36:53,627 WARN L148 SmtUtils]: Spent 2023ms on a formula simplification that was a NOOP. DAG size: 81 [2018-04-12 06:36:55,675 WARN L148 SmtUtils]: Spent 2023ms on a formula simplification that was a NOOP. DAG size: 84 [2018-04-12 06:36:59,754 WARN L151 SmtUtils]: Spent 4052ms on a formula simplification. DAG size of input: 87 DAG size of output 87 [2018-04-12 06:37:03,863 WARN L151 SmtUtils]: Spent 4081ms on a formula simplification. DAG size of input: 90 DAG size of output 90 [2018-04-12 06:37:07,962 WARN L151 SmtUtils]: Spent 4066ms on a formula simplification. DAG size of input: 91 DAG size of output 90 [2018-04-12 06:37:09,384 WARN L151 SmtUtils]: Spent 1391ms on a formula simplification. DAG size of input: 95 DAG size of output 94 [2018-04-12 06:37:11,141 WARN L151 SmtUtils]: Spent 1721ms on a formula simplification. DAG size of input: 99 DAG size of output 98 [2018-04-12 06:37:12,624 WARN L151 SmtUtils]: Spent 1439ms on a formula simplification. DAG size of input: 96 DAG size of output 95 [2018-04-12 06:37:16,767 WARN L151 SmtUtils]: Spent 4092ms on a formula simplification. DAG size of input: 104 DAG size of output 100 [2018-04-12 06:37:20,909 WARN L151 SmtUtils]: Spent 4093ms on a formula simplification. DAG size of input: 108 DAG size of output 104 [2018-04-12 06:37:25,291 WARN L151 SmtUtils]: Spent 4088ms on a formula simplification. DAG size of input: 94 DAG size of output 93 [2018-04-12 06:37:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:37:26,023 INFO L93 Difference]: Finished difference Result 338 states and 384 transitions. [2018-04-12 06:37:26,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-12 06:37:26,023 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 63 [2018-04-12 06:37:26,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:37:26,024 INFO L225 Difference]: With dead ends: 338 [2018-04-12 06:37:26,024 INFO L226 Difference]: Without dead ends: 337 [2018-04-12 06:37:26,025 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=560, Invalid=2299, Unknown=3, NotChecked=0, Total=2862 [2018-04-12 06:37:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-12 06:37:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 311. [2018-04-12 06:37:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-04-12 06:37:26,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 352 transitions. [2018-04-12 06:37:26,031 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 352 transitions. Word has length 63 [2018-04-12 06:37:26,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:37:26,031 INFO L459 AbstractCegarLoop]: Abstraction has 311 states and 352 transitions. [2018-04-12 06:37:26,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 06:37:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 352 transitions. [2018-04-12 06:37:26,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-12 06:37:26,032 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:37:26,032 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:37:26,032 INFO L408 AbstractCegarLoop]: === Iteration 23 === [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-12 06:37:26,033 INFO L82 PathProgramCache]: Analyzing trace with hash 673668519, now seen corresponding path program 1 times [2018-04-12 06:37:26,033 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:37:26,033 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:37:26,033 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:37:26,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:37:26,034 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:37:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:37:26,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:37:26,050 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:37:26,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:37:26,050 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:37:26,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:37:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:37:26,134 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:37:26,159 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-12 06:37:26,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:26,163 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-12 06:37:26,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-12 06:37:26,179 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-12 06:37:26,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:26,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:26,188 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-12 06:37:26,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:26,193 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-12 06:37:26,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-12 06:37:26,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:26,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:26,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:26,211 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-12 06:37:26,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:26,219 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-12 06:37:26,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:28 [2018-04-12 06:37:26,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-04-12 06:37:26,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:26,271 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-12 06:37:26,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:33 [2018-04-12 06:37:26,288 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 6 not checked. [2018-04-12 06:37:26,289 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:37:26,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 06:37:26,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 06:37:26,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 06:37:26,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=65, Unknown=1, NotChecked=16, Total=110 [2018-04-12 06:37:26,289 INFO L87 Difference]: Start difference. First operand 311 states and 352 transitions. Second operand 11 states. [2018-04-12 06:37:26,337 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((main_~list~0.base Int)) (= 1 (select |c_#valid| main_~list~0.base))) (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-12 06:37:26,963 WARN L151 SmtUtils]: Spent 599ms on a formula simplification. DAG size of input: 31 DAG size of output 25 [2018-04-12 06:37:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:37:27,178 INFO L93 Difference]: Finished difference Result 354 states and 379 transitions. [2018-04-12 06:37:27,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 06:37:27,178 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-04-12 06:37:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:37:27,179 INFO L225 Difference]: With dead ends: 354 [2018-04-12 06:37:27,179 INFO L226 Difference]: Without dead ends: 354 [2018-04-12 06:37:27,179 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=181, Unknown=2, NotChecked=58, Total=306 [2018-04-12 06:37:27,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-04-12 06:37:27,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 265. [2018-04-12 06:37:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-12 06:37:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 289 transitions. [2018-04-12 06:37:27,183 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 289 transitions. Word has length 65 [2018-04-12 06:37:27,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:37:27,183 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 289 transitions. [2018-04-12 06:37:27,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 06:37:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 289 transitions. [2018-04-12 06:37:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-12 06:37:27,184 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:37:27,184 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:37:27,184 INFO L408 AbstractCegarLoop]: === Iteration 24 === [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-12 06:37:27,184 INFO L82 PathProgramCache]: Analyzing trace with hash 673668520, now seen corresponding path program 1 times [2018-04-12 06:37:27,184 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:37:27,184 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:37:27,185 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:37:27,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:37:27,185 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:37:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:37:27,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:37:27,205 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:37:27,206 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:37:27,206 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:37:27,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:37:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:37:27,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:37:27,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:27,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:27,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:27,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:27,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:27,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-12 06:37:27,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:27,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:27,406 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-12 06:37:27,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:27,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:27,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:27,419 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-12 06:37:27,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:27,428 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-12 06:37:27,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-04-12 06:37:27,450 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-12 06:37:27,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:27,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:27,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:27,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:27,460 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-12 06:37:27,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:27,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:27,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:27,472 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 17 treesize of output 36 [2018-04-12 06:37:27,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:27,481 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-12 06:37:27,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:26 [2018-04-12 06:37:27,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:27,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:27,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:27,551 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 2 case distinctions, treesize of input 22 treesize of output 37 [2018-04-12 06:37:27,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-12 06:37:27,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-12 06:37:27,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:66 [2018-04-12 06:37:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2018-04-12 06:37:27,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:37:27,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-12 06:37:27,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 06:37:27,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 06:37:27,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=266, Unknown=1, NotChecked=32, Total=342 [2018-04-12 06:37:27,637 INFO L87 Difference]: Start difference. First operand 265 states and 289 transitions. Second operand 19 states. [2018-04-12 06:37:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:37:28,517 INFO L93 Difference]: Finished difference Result 287 states and 305 transitions. [2018-04-12 06:37:28,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 06:37:28,518 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2018-04-12 06:37:28,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:37:28,518 INFO L225 Difference]: With dead ends: 287 [2018-04-12 06:37:28,518 INFO L226 Difference]: Without dead ends: 287 [2018-04-12 06:37:28,519 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=840, Unknown=2, NotChecked=60, Total=1056 [2018-04-12 06:37:28,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-04-12 06:37:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 256. [2018-04-12 06:37:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-12 06:37:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 280 transitions. [2018-04-12 06:37:28,522 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 280 transitions. Word has length 65 [2018-04-12 06:37:28,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:37:28,522 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 280 transitions. [2018-04-12 06:37:28,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 06:37:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 280 transitions. [2018-04-12 06:37:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-12 06:37:28,523 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:37:28,523 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:37:28,523 INFO L408 AbstractCegarLoop]: === Iteration 25 === [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-12 06:37:28,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1088555564, now seen corresponding path program 1 times [2018-04-12 06:37:28,523 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:37:28,523 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:37:28,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:37:28,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:37:28,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:37:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:37:28,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:37:28,538 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:37:28,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:37:28,538 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:37:28,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:37:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:37:28,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:37:28,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:37:28,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:28,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:28,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:37:28,640 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-12 06:37:28,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:28,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:28,649 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-12 06:37:28,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:28,657 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-12 06:37:28,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-04-12 06:37:28,778 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-12 06:37:28,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:28,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:28,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:28,790 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-12 06:37:28,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-04-12 06:37:28,823 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-12 06:37:28,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-12 06:37:28,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:28,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:28,871 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-12 06:37:28,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-04-12 06:37:28,933 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-12 06:37:28,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:28,936 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-12 06:37:28,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:28,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:28,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:28,966 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-12 06:37:28,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 06:37:28,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:37:29,005 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-12 06:37:29,005 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:76, output treesize:107 [2018-04-12 06:37:29,043 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-12 06:37:29,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:29,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:29,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:29,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:29,061 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 34 treesize of output 52 [2018-04-12 06:37:29,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:29,077 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-12 06:37:29,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:141, output treesize:91 [2018-04-12 06:37:29,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:29,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:29,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:29,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:29,166 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-12 06:37:29,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:29,188 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-12 06:37:29,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:102, output treesize:114 [2018-04-12 06:37:29,270 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-12 06:37:29,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:29,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:29,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:29,309 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-12 06:37:29,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:127, output treesize:114 [2018-04-12 06:37:29,345 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-12 06:37:29,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:29,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:29,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:29,377 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-12 06:37:29,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:127, output treesize:123 [2018-04-12 06:37:29,439 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 88 treesize of output 71 [2018-04-12 06:37:29,441 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:29,441 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 39 treesize of output 23 [2018-04-12 06:37:29,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:29,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:29,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 06:37:29,455 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:29,463 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-12 06:37:29,463 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:29,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:29,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:29,485 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:127, output treesize:45 [2018-04-12 06:37:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 20 not checked. [2018-04-12 06:37:29,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:37:29,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-12 06:37:29,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-12 06:37:29,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-12 06:37:29,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=453, Unknown=1, NotChecked=42, Total=552 [2018-04-12 06:37:29,534 INFO L87 Difference]: Start difference. First operand 256 states and 280 transitions. Second operand 24 states. [2018-04-12 06:37:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:37:31,194 INFO L93 Difference]: Finished difference Result 349 states and 379 transitions. [2018-04-12 06:37:31,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 06:37:31,194 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-04-12 06:37:31,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:37:31,195 INFO L225 Difference]: With dead ends: 349 [2018-04-12 06:37:31,195 INFO L226 Difference]: Without dead ends: 349 [2018-04-12 06:37:31,196 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=252, Invalid=1557, Unknown=1, NotChecked=82, Total=1892 [2018-04-12 06:37:31,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-12 06:37:31,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 283. [2018-04-12 06:37:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-04-12 06:37:31,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 313 transitions. [2018-04-12 06:37:31,199 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 313 transitions. Word has length 72 [2018-04-12 06:37:31,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:37:31,200 INFO L459 AbstractCegarLoop]: Abstraction has 283 states and 313 transitions. [2018-04-12 06:37:31,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-12 06:37:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 313 transitions. [2018-04-12 06:37:31,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-12 06:37:31,200 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:37:31,200 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:37:31,201 INFO L408 AbstractCegarLoop]: === Iteration 26 === [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-12 06:37:31,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1088555563, now seen corresponding path program 1 times [2018-04-12 06:37:31,201 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:37:31,201 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:37:31,201 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:37:31,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:37:31,201 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:37:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:37:31,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:37:31,224 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:37:31,224 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:37:31,224 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:37:31,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:37:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:37:31,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:37:31,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 06:37:31,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:37:31,324 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-12 06:37:31,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:31,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:31,333 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-12 06:37:31,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,348 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-12 06:37:31,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-04-12 06:37:31,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, 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-12 06:37:31,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:31,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,432 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-12 06:37:31,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:31,434 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,443 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-04-12 06:37:31,473 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-12 06:37:31,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:31,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,511 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 53 [2018-04-12 06:37:31,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 36 treesize of output 35 [2018-04-12 06:37:31,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,542 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:67 [2018-04-12 06:37:31,583 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-12 06:37:31,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:31,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:31,596 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-12 06:37:31,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 06:37:31,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:31,665 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 129 treesize of output 156 [2018-04-12 06:37:31,665 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:37:31,754 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 154 treesize of output 152 [2018-04-12 06:37:31,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:31,757 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 147 treesize of output 174 [2018-04-12 06:37:31,757 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,818 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,820 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:31,820 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 114 treesize of output 104 [2018-04-12 06:37:31,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:31,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:31,836 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:31,837 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 60 [2018-04-12 06:37:31,837 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,847 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:37:31,873 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:172, output treesize:211 [2018-04-12 06:37:31,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:31,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:31,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:31,953 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 169 treesize of output 168 [2018-04-12 06:37:31,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:31,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:240, output treesize:151 [2018-04-12 06:37:32,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:32,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:32,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:32,089 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 20 treesize of output 21 [2018-04-12 06:37:32,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,107 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 22 treesize of output 29 [2018-04-12 06:37:32,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:137, output treesize:129 [2018-04-12 06:37:32,236 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 111 treesize of output 128 [2018-04-12 06:37:32,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:32,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,280 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 113 treesize of output 113 [2018-04-12 06:37:32,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 06:37:32,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,314 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:129 [2018-04-12 06:37:32,322 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 109 treesize of output 126 [2018-04-12 06:37:32,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:32,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,361 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 111 treesize of output 111 [2018-04-12 06:37:32,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 06:37:32,364 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,398 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-12 06:37:32,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:148, output treesize:140 [2018-04-12 06:37:32,446 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 0 case distinctions, treesize of input 114 treesize of output 92 [2018-04-12 06:37:32,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 46 [2018-04-12 06:37:32,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:32,467 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 23 treesize of output 16 [2018-04-12 06:37:32,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,488 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 0 case distinctions, treesize of input 66 treesize of output 60 [2018-04-12 06:37:32,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 28 [2018-04-12 06:37:32,490 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:32,500 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-12 06:37:32,500 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,504 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:32,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:32,512 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:151, output treesize:23 [2018-04-12 06:37:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 20 not checked. [2018-04-12 06:37:32,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:37:32,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-12 06:37:32,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-12 06:37:32,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-12 06:37:32,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=456, Unknown=1, NotChecked=42, Total=552 [2018-04-12 06:37:32,558 INFO L87 Difference]: Start difference. First operand 283 states and 313 transitions. Second operand 24 states. [2018-04-12 06:37:33,762 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 106 DAG size of output 76 [2018-04-12 06:37:34,068 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 110 DAG size of output 84 [2018-04-12 06:37:34,242 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 121 DAG size of output 95 [2018-04-12 06:37:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:37:34,730 INFO L93 Difference]: Finished difference Result 425 states and 469 transitions. [2018-04-12 06:37:34,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 06:37:34,730 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-04-12 06:37:34,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:37:34,732 INFO L225 Difference]: With dead ends: 425 [2018-04-12 06:37:34,732 INFO L226 Difference]: Without dead ends: 425 [2018-04-12 06:37:34,733 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=286, Invalid=1938, Unknown=36, NotChecked=92, Total=2352 [2018-04-12 06:37:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-04-12 06:37:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 311. [2018-04-12 06:37:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-04-12 06:37:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 349 transitions. [2018-04-12 06:37:34,739 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 349 transitions. Word has length 72 [2018-04-12 06:37:34,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:37:34,739 INFO L459 AbstractCegarLoop]: Abstraction has 311 states and 349 transitions. [2018-04-12 06:37:34,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-12 06:37:34,739 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 349 transitions. [2018-04-12 06:37:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-12 06:37:34,740 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:37:34,740 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:37:34,740 INFO L408 AbstractCegarLoop]: === Iteration 27 === [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-12 06:37:34,740 INFO L82 PathProgramCache]: Analyzing trace with hash -278514865, now seen corresponding path program 1 times [2018-04-12 06:37:34,740 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:37:34,740 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:37:34,741 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:37:34,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:37:34,741 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:37:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:37:34,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:37:34,761 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:37:34,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:37:34,761 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:37:34,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:37:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:37:34,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:37:34,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:37:34,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:34,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:34,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:37:34,855 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-12 06:37:34,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:34,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:34,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:3 [2018-04-12 06:37:34,913 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-12 06:37:34,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:34,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:34,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:34,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:34,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-04-12 06:37:35,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:35,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:35,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:35,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2018-04-12 06:37:35,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:35,021 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-12 06:37:35,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:45 [2018-04-12 06:37:35,115 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 41 treesize of output 42 [2018-04-12 06:37:35,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16 treesize of output 15 [2018-04-12 06:37:35,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:35,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:35,133 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-12 06:37:35,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:60 [2018-04-12 06:37:35,165 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 50 treesize of output 49 [2018-04-12 06:37:35,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:35,171 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 24 treesize of output 33 [2018-04-12 06:37:35,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:35,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:35,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:35,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:73, output treesize:69 [2018-04-12 06:37:35,224 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 55 treesize of output 47 [2018-04-12 06:37:35,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:35,227 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 19 treesize of output 8 [2018-04-12 06:37:35,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:35,234 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:35,235 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 25 treesize of output 17 [2018-04-12 06:37:35,235 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:35,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:35,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:35,249 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:78, output treesize:24 [2018-04-12 06:37:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 06:37:35,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:37:35,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-12 06:37:35,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 06:37:35,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 06:37:35,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-04-12 06:37:35,296 INFO L87 Difference]: Start difference. First operand 311 states and 349 transitions. Second operand 18 states. [2018-04-12 06:37:38,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:37:38,307 INFO L93 Difference]: Finished difference Result 345 states and 382 transitions. [2018-04-12 06:37:38,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 06:37:38,307 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2018-04-12 06:37:38,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:37:38,308 INFO L225 Difference]: With dead ends: 345 [2018-04-12 06:37:38,308 INFO L226 Difference]: Without dead ends: 345 [2018-04-12 06:37:38,309 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2018-04-12 06:37:38,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-04-12 06:37:38,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 315. [2018-04-12 06:37:38,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-04-12 06:37:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 351 transitions. [2018-04-12 06:37:38,313 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 351 transitions. Word has length 72 [2018-04-12 06:37:38,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:37:38,314 INFO L459 AbstractCegarLoop]: Abstraction has 315 states and 351 transitions. [2018-04-12 06:37:38,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 06:37:38,314 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 351 transitions. [2018-04-12 06:37:38,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-12 06:37:38,314 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:37:38,315 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:37:38,315 INFO L408 AbstractCegarLoop]: === Iteration 28 === [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-12 06:37:38,315 INFO L82 PathProgramCache]: Analyzing trace with hash -278514864, now seen corresponding path program 1 times [2018-04-12 06:37:38,315 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:37:38,315 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:37:38,316 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:37:38,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:37:38,316 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:37:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:37:38,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:37:38,351 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:37:38,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:37:38,352 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:37:38,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:37:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:37:38,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:37:38,448 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 5 treesize of output 1 [2018-04-12 06:37:38,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-04-12 06:37:38,545 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-12 06:37:38,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:38,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,565 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-12 06:37:38,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 06:37:38,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:54 [2018-04-12 06:37:38,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:38,650 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 26 treesize of output 35 [2018-04-12 06:37:38,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:38,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:38,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:38,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:38,671 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2018-04-12 06:37:38,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 06:37:38,687 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-12 06:37:38,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:63 [2018-04-12 06:37:38,797 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 57 treesize of output 58 [2018-04-12 06:37:38,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16 treesize of output 15 [2018-04-12 06:37:38,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,823 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 43 treesize of output 44 [2018-04-12 06:37:38,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 06:37:38,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,830 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:38,843 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:81 [2018-04-12 06:37:38,878 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 43 treesize of output 44 [2018-04-12 06:37:38,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:38,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,906 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 66 treesize of output 65 [2018-04-12 06:37:38,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:38,909 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:38,909 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 24 treesize of output 42 [2018-04-12 06:37:38,909 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:38,933 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:107, output treesize:99 [2018-04-12 06:37:38,966 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 48 treesize of output 44 [2018-04-12 06:37:38,968 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-12 06:37:38,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,974 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:38,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-12 06:37:38,975 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:38,994 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 65 treesize of output 55 [2018-04-12 06:37:38,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:38,997 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:38,997 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 19 treesize of output 16 [2018-04-12 06:37:38,997 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:39,004 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:39,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-12 06:37:39,005 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:39,008 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:39,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:39,015 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:117, output treesize:20 [2018-04-12 06:37:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 06:37:39,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:37:39,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-12 06:37:39,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 06:37:39,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 06:37:39,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-04-12 06:37:39,051 INFO L87 Difference]: Start difference. First operand 315 states and 351 transitions. Second operand 22 states. [2018-04-12 06:37:40,558 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 113 DAG size of output 86 [2018-04-12 06:37:40,753 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 104 DAG size of output 77 [2018-04-12 06:37:40,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:37:40,951 INFO L93 Difference]: Finished difference Result 319 states and 356 transitions. [2018-04-12 06:37:40,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 06:37:40,951 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2018-04-12 06:37:40,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:37:40,952 INFO L225 Difference]: With dead ends: 319 [2018-04-12 06:37:40,952 INFO L226 Difference]: Without dead ends: 319 [2018-04-12 06:37:40,952 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=411, Invalid=1311, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 06:37:40,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-04-12 06:37:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2018-04-12 06:37:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-04-12 06:37:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 350 transitions. [2018-04-12 06:37:40,957 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 350 transitions. Word has length 72 [2018-04-12 06:37:40,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:37:40,957 INFO L459 AbstractCegarLoop]: Abstraction has 315 states and 350 transitions. [2018-04-12 06:37:40,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 06:37:40,957 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 350 transitions. [2018-04-12 06:37:40,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-12 06:37:40,957 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:37:40,957 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:37:40,957 INFO L408 AbstractCegarLoop]: === Iteration 29 === [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-12 06:37:40,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1905389954, now seen corresponding path program 1 times [2018-04-12 06:37:40,958 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:37:40,958 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:37:40,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:37:40,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:37:40,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:37:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:37:40,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:37:40,979 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:37:40,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:37:40,979 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:37:40,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:37:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:37:41,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:37:41,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:41,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:37:41,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-12 06:37:41,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:41,110 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-12 06:37:41,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:41,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:41,121 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-12 06:37:41,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-12 06:37:41,151 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-12 06:37:41,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 06:37:41,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,165 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-12 06:37:41,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:41,167 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,179 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-04-12 06:37:41,195 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-12 06:37:41,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:41,197 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-12 06:37:41,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,217 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-12 06:37:41,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:41,219 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-12 06:37:41,219 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,234 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:66 [2018-04-12 06:37:41,760 WARN L151 SmtUtils]: Spent 222ms on a formula simplification. DAG size of input: 94 DAG size of output 76 [2018-04-12 06:37:41,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:41,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:41,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:41,770 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 17 treesize of output 34 [2018-04-12 06:37:41,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:41,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:41,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:41,854 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-12 06:37:41,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:41,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:41,953 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-12 06:37:41,956 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-12 06:37:41,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:41,960 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-12 06:37:41,960 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,970 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:41,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:41,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:42,010 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-12 06:37:42,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:42,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:42,016 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-12 06:37:42,016 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:42,022 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:42,037 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:42,051 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:42,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:42,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:42,114 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 66 [2018-04-12 06:37:42,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:37:42,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:42,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, 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-12 06:37:42,118 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:42,123 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:42,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:42,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:42,144 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 57 treesize of output 95 [2018-04-12 06:37:42,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-12 06:37:42,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:42,149 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 24 treesize of output 39 [2018-04-12 06:37:42,149 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:42,153 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:42,165 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:42,173 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:42,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:42,209 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:185, output treesize:213 [2018-04-12 06:37:55,088 WARN L151 SmtUtils]: Spent 2239ms on a formula simplification. DAG size of input: 142 DAG size of output 135 [2018-04-12 06:37:55,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:55,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:55,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:55,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:55,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:55,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:55,182 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 73 [2018-04-12 06:37:55,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:56,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:56,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:56,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:56,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 79 [2018-04-12 06:37:56,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:57,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 237 [2018-04-12 06:37:57,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 47 treesize of output 44 [2018-04-12 06:37:57,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,316 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 44 treesize of output 50 [2018-04-12 06:37:57,316 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:57,335 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:57,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 204 [2018-04-12 06:37:57,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,598 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 4 case distinctions, treesize of input 25 treesize of output 52 [2018-04-12 06:37:57,599 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-12 06:37:57,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 185 [2018-04-12 06:37:57,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,794 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:57,801 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2018-04-12 06:37:57,801 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:57,848 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:57,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 214 [2018-04-12 06:37:57,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:57,894 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:57,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 125 treesize of output 110 [2018-04-12 06:37:57,895 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:57,948 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:58,042 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:37:58,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:37:58,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:58,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:58,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:58,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:58,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:58,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:58,504 INFO L303 Elim1Store]: Index analysis took 274 ms [2018-04-12 06:37:58,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 230 [2018-04-12 06:37:58,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-12 06:37:58,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:58,522 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-12 06:37:58,522 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:58,539 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:58,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:58,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:58,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:58,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:58,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:58,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:58,916 INFO L303 Elim1Store]: Index analysis took 166 ms [2018-04-12 06:37:58,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 179 treesize of output 234 [2018-04-12 06:37:58,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 225 treesize of output 224 [2018-04-12 06:37:58,948 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:59,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:59,580 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:59,595 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 164 treesize of output 205 [2018-04-12 06:37:59,595 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:00,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:00,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:00,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:00,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:00,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:00,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:00,308 INFO L303 Elim1Store]: Index analysis took 140 ms [2018-04-12 06:38:00,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 204 [2018-04-12 06:38:00,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:00,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:00,318 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:38:00,329 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2018-04-12 06:38:00,329 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:00,436 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:00,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:00,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:00,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:00,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:00,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:00,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:01,005 INFO L303 Elim1Store]: Index analysis took 139 ms [2018-04-12 06:38:01,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 197 [2018-04-12 06:38:01,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:01,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:01,015 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:38:01,023 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2018-04-12 06:38:01,023 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:01,111 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:01,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:01,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:01,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:01,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:01,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 175 [2018-04-12 06:38:01,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:01,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:01,441 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:38:01,449 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 110 treesize of output 95 [2018-04-12 06:38:01,449 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:01,517 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:01,763 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:38:02,148 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:38:02,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:02,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:02,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:02,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:02,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 290 [2018-04-12 06:38:02,892 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 103 DAG size of output 95 [2018-04-12 06:38:02,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 47 treesize of output 44 [2018-04-12 06:38:02,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:02,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 50 [2018-04-12 06:38:02,903 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:02,916 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:03,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 203 [2018-04-12 06:38:03,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 52 [2018-04-12 06:38:03,054 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 4 xjuncts. [2018-04-12 06:38:03,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 197 [2018-04-12 06:38:03,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,152 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:38:03,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 150 [2018-04-12 06:38:03,153 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:03,187 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:03,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 199 [2018-04-12 06:38:03,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,212 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:38:03,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 150 [2018-04-12 06:38:03,213 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:03,247 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:03,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 197 [2018-04-12 06:38:03,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,272 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:38:03,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 150 [2018-04-12 06:38:03,273 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:03,307 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:03,390 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-12 06:38:03,497 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-12 06:38:03,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 243 [2018-04-12 06:38:03,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:38:03,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,558 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-12 06:38:03,558 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:03,566 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:03,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 166 [2018-04-12 06:38:03,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-04-12 06:38:03,681 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:03,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 154 [2018-04-12 06:38:03,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,746 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:38:03,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 92 [2018-04-12 06:38:03,747 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:03,780 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:03,801 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:03,836 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:03,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,939 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-04-12 06:38:03,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 283 [2018-04-12 06:38:03,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:38:03,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:03,954 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-12 06:38:03,954 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:03,964 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:04,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 229 [2018-04-12 06:38:04,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 228 [2018-04-12 06:38:04,139 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:04,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,374 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:38:04,378 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 154 treesize of output 187 [2018-04-12 06:38:04,378 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:04,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 174 [2018-04-12 06:38:04,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,569 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:38:04,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 100 [2018-04-12 06:38:04,570 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:04,603 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:04,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 208 [2018-04-12 06:38:04,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,757 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:38:04,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 158 [2018-04-12 06:38:04,758 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:04,800 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:04,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 205 [2018-04-12 06:38:04,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:04,952 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:38:04,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 142 [2018-04-12 06:38:04,953 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:04,990 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:05,050 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:38:05,119 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:38:05,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 288 [2018-04-12 06:38:05,290 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 101 DAG size of output 93 [2018-04-12 06:38:05,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 47 treesize of output 44 [2018-04-12 06:38:05,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,299 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 44 treesize of output 50 [2018-04-12 06:38:05,299 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:05,310 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:05,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 193 [2018-04-12 06:38:05,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,427 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:38:05,432 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 25 treesize of output 42 [2018-04-12 06:38:05,432 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:05,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 184 [2018-04-12 06:38:05,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:05,498 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:38:05,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 142 [2018-04-12 06:38:05,499 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:05,530 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:05,549 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:05,586 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:05,588 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-12 06:38:05,588 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:05,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 15 dim-0 vars, and 4 xjuncts. [2018-04-12 06:38:05,824 INFO L202 ElimStorePlain]: Needed 62 recursive calls to eliminate 13 variables, input treesize:447, output treesize:1199 [2018-04-12 06:38:06,525 WARN L151 SmtUtils]: Spent 546ms on a formula simplification. DAG size of input: 257 DAG size of output 198 [2018-04-12 06:38:06,862 WARN L148 SmtUtils]: Spent 165ms on a formula simplification that was a NOOP. DAG size: 232 [2018-04-12 06:38:07,196 WARN L148 SmtUtils]: Spent 179ms on a formula simplification that was a NOOP. DAG size: 232 [2018-04-12 06:38:07,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 291 treesize of output 322 [2018-04-12 06:38:07,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:07,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 282 treesize of output 328 [2018-04-12 06:38:07,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 06:38:07,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:07,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 330 treesize of output 377 [2018-04-12 06:38:07,785 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:08,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 316 [2018-04-12 06:38:08,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:08,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 276 [2018-04-12 06:38:08,424 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:08,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:08,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 331 [2018-04-12 06:38:08,729 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:09,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 6 dim-1 vars, End of recursive call: 20 dim-0 vars, and 4 xjuncts. [2018-04-12 06:38:09,047 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 20 variables, input treesize:907, output treesize:1199 [2018-04-12 06:38:11,611 WARN L148 SmtUtils]: Spent 363ms on a formula simplification that was a NOOP. DAG size: 318 [2018-04-12 06:38:12,197 WARN L148 SmtUtils]: Spent 377ms on a formula simplification that was a NOOP. DAG size: 318 [2018-04-12 06:38:19,956 WARN L148 SmtUtils]: Spent 603ms on a formula simplification that was a NOOP. DAG size: 346 [2018-04-12 06:38:31,339 WARN L151 SmtUtils]: Spent 4682ms on a formula simplification. DAG size of input: 1022 DAG size of output 349 [2018-04-12 06:38:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-12 06:38:31,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:38:31,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-12 06:38:31,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-12 06:38:31,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-12 06:38:31,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1002, Unknown=35, NotChecked=0, Total=1122 [2018-04-12 06:38:31,426 INFO L87 Difference]: Start difference. First operand 315 states and 350 transitions. Second operand 34 states. [2018-04-12 06:39:13,448 WARN L151 SmtUtils]: Spent 589ms on a formula simplification. DAG size of input: 217 DAG size of output 217 [2018-04-12 06:39:14,272 WARN L148 SmtUtils]: Spent 188ms on a formula simplification that was a NOOP. DAG size: 241 [2018-04-12 06:39:15,986 WARN L151 SmtUtils]: Spent 398ms on a formula simplification. DAG size of input: 326 DAG size of output 245 [2018-04-12 06:39:16,776 WARN L148 SmtUtils]: Spent 357ms on a formula simplification that was a NOOP. DAG size: 338 [2018-04-12 06:39:20,014 WARN L151 SmtUtils]: Spent 720ms on a formula simplification. DAG size of input: 384 DAG size of output 341 [2018-04-12 06:39:23,075 WARN L151 SmtUtils]: Spent 741ms on a formula simplification. DAG size of input: 387 DAG size of output 343 [2018-04-12 06:39:57,888 WARN L151 SmtUtils]: Spent 34419ms on a formula simplification. DAG size of input: 479 DAG size of output 461 [2018-04-12 06:40:38,878 WARN L151 SmtUtils]: Spent 40461ms on a formula simplification. DAG size of input: 573 DAG size of output 462 [2018-04-12 06:40:46,017 WARN L151 SmtUtils]: Spent 797ms on a formula simplification. DAG size of input: 390 DAG size of output 346 [2018-04-12 06:41:44,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:41:44,405 INFO L93 Difference]: Finished difference Result 373 states and 420 transitions. [2018-04-12 06:41:44,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-12 06:41:44,405 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 74 [2018-04-12 06:41:44,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:41:44,406 INFO L225 Difference]: With dead ends: 373 [2018-04-12 06:41:44,406 INFO L226 Difference]: Without dead ends: 373 [2018-04-12 06:41:44,407 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 124.8s TimeCoverageRelationStatistics Valid=271, Invalid=2301, Unknown=80, NotChecked=0, Total=2652 [2018-04-12 06:41:44,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-04-12 06:41:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 334. [2018-04-12 06:41:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-04-12 06:41:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 376 transitions. [2018-04-12 06:41:44,412 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 376 transitions. Word has length 74 [2018-04-12 06:41:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:41:44,412 INFO L459 AbstractCegarLoop]: Abstraction has 334 states and 376 transitions. [2018-04-12 06:41:44,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-12 06:41:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 376 transitions. [2018-04-12 06:41:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-12 06:41:44,413 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:41:44,413 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:41:44,413 INFO L408 AbstractCegarLoop]: === Iteration 30 === [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-12 06:41:44,413 INFO L82 PathProgramCache]: Analyzing trace with hash 937586753, now seen corresponding path program 2 times [2018-04-12 06:41:44,413 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:41:44,414 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:41:44,414 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:41:44,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:41:44,414 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:41:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:41:44,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:41:44,436 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:41:44,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:41:44,436 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:41:44,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 06:41:44,558 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 06:41:44,558 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 06:41:44,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:41:44,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:41:44,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:44,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:44,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:41:44,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:44,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:44,588 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-12 06:41:44,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:44,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:41:44,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:44,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:44,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-12 06:41:44,654 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 13 treesize of output 10 [2018-04-12 06:41:44,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:41:44,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:44,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:44,676 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 13 treesize of output 10 [2018-04-12 06:41:44,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:41:44,678 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:44,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:44,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:44,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-12 06:41:53,130 WARN L148 SmtUtils]: Spent 2028ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-12 06:41:53,478 WARN L151 SmtUtils]: Spent 345ms on a formula simplification. DAG size of input: 84 DAG size of output 81 [2018-04-12 06:41:53,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:53,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:53,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:53,490 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-12 06:41:53,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:53,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:53,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-12 06:41:53,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:53,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:53,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, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 49 [2018-04-12 06:41:53,832 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-12 06:41:53,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:53,835 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-12 06:41:53,835 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:53,841 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:53,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:53,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 49 [2018-04-12 06:41:53,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-04-12 06:41:53,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 15 [2018-04-12 06:41:53,876 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:53,882 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:53,893 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:53,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:53,913 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 48 treesize of output 50 [2018-04-12 06:41:53,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 33 [2018-04-12 06:41:53,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:53,919 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 33 treesize of output 37 [2018-04-12 06:41:53,919 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:53,926 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:53,948 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 40 treesize of output 37 [2018-04-12 06:41:53,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:53,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:53,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:53,957 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 42 [2018-04-12 06:41:53,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:53,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:53,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:53,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:53,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 57 [2018-04-12 06:41:53,977 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:53,988 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:53,997 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:54,009 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:54,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:54,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-04-12 06:41:54,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12 06:41:54,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:54,092 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-12 06:41:54,092 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:54,097 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:54,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:54,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 74 [2018-04-12 06:41:54,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 17 treesize of output 20 [2018-04-12 06:41:54,120 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 20 treesize of output 27 [2018-04-12 06:41:54,120 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:54,123 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:54,133 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:54,140 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:54,144 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 48 treesize of output 50 [2018-04-12 06:41:54,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 33 [2018-04-12 06:41:54,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:54,149 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 33 treesize of output 37 [2018-04-12 06:41:54,149 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:54,155 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:54,168 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 40 treesize of output 43 [2018-04-12 06:41:54,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:54,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:54,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:54,172 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2018-04-12 06:41:54,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:54,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:54,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:54,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:54,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 81 [2018-04-12 06:41:54,177 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:54,186 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:54,193 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:54,202 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:54,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:41:54,236 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 6 variables, input treesize:154, output treesize:144 [2018-04-12 06:42:08,951 WARN L151 SmtUtils]: Spent 1842ms on a formula simplification. DAG size of input: 135 DAG size of output 128 [2018-04-12 06:42:08,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:08,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:09,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:09,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:09,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:09,037 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 54 [2018-04-12 06:42:09,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:09,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:09,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:10,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:10,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:10,041 INFO L303 Elim1Store]: Index analysis took 137 ms [2018-04-12 06:42:10,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 70 [2018-04-12 06:42:10,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 06:42:10,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:10,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:11,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:11,133 INFO L303 Elim1Store]: Index analysis took 185 ms [2018-04-12 06:42:11,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 177 [2018-04-12 06:42:11,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 173 treesize of output 175 [2018-04-12 06:42:11,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:11,168 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-12 06:42:11,168 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:11,358 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:42:13,099 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 141 [2018-04-12 06:42:13,101 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-12 06:42:13,101 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:13,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:13,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:13,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:13,649 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 129 treesize of output 152 [2018-04-12 06:42:13,649 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:14,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:14,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 142 [2018-04-12 06:42:14,280 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:14,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:14,852 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:14,864 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 129 treesize of output 136 [2018-04-12 06:42:14,864 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:15,377 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 06:42:18,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:18,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:18,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 145 [2018-04-12 06:42:18,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 141 [2018-04-12 06:42:18,175 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:19,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:19,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:19,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 132 [2018-04-12 06:42:19,069 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:19,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:19,965 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:19,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 124 [2018-04-12 06:42:19,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:19,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:19,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:19,973 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:19,973 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 55 treesize of output 65 [2018-04-12 06:42:19,973 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:20,087 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:42:20,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:20,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:20,786 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:20,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 142 [2018-04-12 06:42:20,798 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:20,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 141 [2018-04-12 06:42:20,799 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:20,968 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:42:21,244 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:42:21,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:21,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:21,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 147 [2018-04-12 06:42:21,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 143 [2018-04-12 06:42:21,330 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:22,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:22,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:22,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 134 [2018-04-12 06:42:22,252 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:23,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:23,286 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:23,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 126 [2018-04-12 06:42:23,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:23,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:23,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:23,294 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:23,294 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 55 treesize of output 65 [2018-04-12 06:42:23,295 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:23,441 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:42:24,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:24,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:24,232 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:24,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 136 [2018-04-12 06:42:24,245 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:24,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 63 [2018-04-12 06:42:24,245 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:24,357 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:42:24,661 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:42:24,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:24,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:24,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 138 [2018-04-12 06:42:24,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 134 [2018-04-12 06:42:24,752 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:25,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:25,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:25,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 125 [2018-04-12 06:42:25,541 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:26,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:26,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:26,379 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:26,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 128 [2018-04-12 06:42:26,383 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:26,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 63 [2018-04-12 06:42:26,384 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:26,473 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:42:26,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:26,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:27,032 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:27,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 128 [2018-04-12 06:42:27,044 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:27,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:27,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:27,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 84 [2018-04-12 06:42:27,047 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:27,142 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:42:27,524 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:42:29,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:29,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:29,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:29,627 INFO L303 Elim1Store]: Index analysis took 193 ms [2018-04-12 06:42:29,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 147 treesize of output 170 [2018-04-12 06:42:29,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:29,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:29,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:29,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 139 treesize of output 238 [2018-04-12 06:42:29,751 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-12 06:42:29,751 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:32,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:32,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:32,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:32,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:32,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:32,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:32,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:32,134 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:32,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 215 [2018-04-12 06:42:32,165 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:36,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:36,738 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:36,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:36,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:36,752 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:36,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 147 treesize of output 181 [2018-04-12 06:42:36,762 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:41,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:41,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:41,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:41,313 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:41,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:41,319 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:41,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 149 treesize of output 185 [2018-04-12 06:42:41,341 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:45,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:45,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:45,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:45,758 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:45,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:45,765 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:45,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 147 treesize of output 183 [2018-04-12 06:42:45,777 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:51,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:51,848 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:51,868 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:51,903 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-04-12 06:42:51,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 153 treesize of output 186 [2018-04-12 06:42:51,924 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 4 xjuncts. [2018-04-12 06:42:53,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:53,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:53,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:53,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:53,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:53,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:53,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:53,700 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:53,712 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:53,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 230 [2018-04-12 06:42:53,724 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-12 06:43:05,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:05,761 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:43:05,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:05,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:05,779 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:43:05,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 149 treesize of output 183 [2018-04-12 06:43:05,794 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-12 06:43:10,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:10,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:10,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:10,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:10,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:10,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:10,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:10,877 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:43:10,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 213 [2018-04-12 06:43:10,898 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-12 06:43:12,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:12,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:12,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:12,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:12,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:12,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:12,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:12,634 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:43:12,644 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:43:12,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 228 [2018-04-12 06:43:12,653 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-12 06:43:20,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:20,950 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:43:20,962 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:43:21,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 151 treesize of output 184 [2018-04-12 06:43:21,007 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 4 xjuncts. [2018-04-12 06:43:22,848 INFO L267 ElimStorePlain]: Start of recursive call 34: 32 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-04-12 06:43:54,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:54,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 164 [2018-04-12 06:43:54,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:54,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:54,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:54,102 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:43:54,102 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 144 treesize of output 174 [2018-04-12 06:43:54,103 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-12 06:43:55,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:55,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:55,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:55,205 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:43:55,208 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 140 treesize of output 170 [2018-04-12 06:43:55,208 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-12 06:43:56,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:56,179 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:43:56,185 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 134 treesize of output 141 [2018-04-12 06:43:56,185 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-12 06:43:57,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:57,118 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:43:57,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 149 [2018-04-12 06:43:57,125 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-12 06:43:58,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:58,029 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:43:58,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 147 [2018-04-12 06:43:58,041 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-12 06:43:58,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:43:58,887 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:43:58,893 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 136 treesize of output 143 [2018-04-12 06:43:58,893 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-12 06:44:01,555 INFO L267 ElimStorePlain]: Start of recursive call 46: 8 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-12 06:44:41,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 148 [2018-04-12 06:44:41,610 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. Received shutdown request... [2018-04-12 06:45:13,945 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-12 06:45:13,945 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-12 06:45:13,948 WARN L197 ceAbstractionStarter]: Timeout [2018-04-12 06:45:13,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 06:45:13 BoogieIcfgContainer [2018-04-12 06:45:13,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 06:45:13,949 INFO L168 Benchmark]: Toolchain (without parser) took 859326.91 ms. Allocated memory was 483.4 MB in the beginning and 577.2 MB in the end (delta: 93.8 MB). Free memory was 419.1 MB in the beginning and 469.5 MB in the end (delta: -50.5 MB). Peak memory consumption was 400.1 MB. Max. memory is 5.3 GB. [2018-04-12 06:45:13,949 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 483.4 MB. Free memory is still 449.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 06:45:13,950 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.23 ms. Allocated memory is still 483.4 MB. Free memory was 416.4 MB in the beginning and 391.2 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-04-12 06:45:13,950 INFO L168 Benchmark]: Boogie Preprocessor took 44.26 ms. Allocated memory is still 483.4 MB. Free memory was 391.2 MB in the beginning and 388.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-12 06:45:13,950 INFO L168 Benchmark]: RCFGBuilder took 485.51 ms. Allocated memory was 483.4 MB in the beginning and 597.2 MB in the end (delta: 113.8 MB). Free memory was 388.5 MB in the beginning and 508.7 MB in the end (delta: -120.2 MB). Peak memory consumption was 36.3 MB. Max. memory is 5.3 GB. [2018-04-12 06:45:13,950 INFO L168 Benchmark]: TraceAbstraction took 858551.21 ms. Allocated memory was 597.2 MB in the beginning and 577.2 MB in the end (delta: -19.9 MB). Free memory was 508.7 MB in the beginning and 469.5 MB in the end (delta: 39.2 MB). Peak memory consumption was 376.0 MB. Max. memory is 5.3 GB. [2018-04-12 06:45:13,951 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.14 ms. Allocated memory is still 483.4 MB. Free memory is still 449.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 243.23 ms. Allocated memory is still 483.4 MB. Free memory was 416.4 MB in the beginning and 391.2 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.26 ms. Allocated memory is still 483.4 MB. Free memory was 391.2 MB in the beginning and 388.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 485.51 ms. Allocated memory was 483.4 MB in the beginning and 597.2 MB in the end (delta: 113.8 MB). Free memory was 388.5 MB in the beginning and 508.7 MB in the end (delta: -120.2 MB). Peak memory consumption was 36.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 858551.21 ms. Allocated memory was 597.2 MB in the beginning and 577.2 MB in the end (delta: -19.9 MB). Free memory was 508.7 MB in the beginning and 469.5 MB in the end (delta: 39.2 MB). Peak memory consumption was 376.0 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 analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 588]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 588). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 575]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 588]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 588). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 582]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 582]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 575]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 362. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 145 locations, 55 error locations. TIMEOUT Result, 858.5s OverallTime, 30 OverallIterations, 3 TraceHistogramMax, 512.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2877 SDtfs, 5608 SDslu, 13947 SDs, 0 SdLazy, 16147 SolverSat, 842 SolverUnsat, 403 SolverUnknown, 0 SolverNotchecked, 233.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1408 GetRequests, 788 SyntacticMatches, 17 SemanticMatches, 603 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 3892 ImplicationChecksByTransitivity, 367.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=21, 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.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 862 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 134.4s InterpolantComputationTime, 2405 NumberOfCodeBlocks, 2405 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1320 ConstructedInterpolants, 415 QuantifiedInterpolants, 2982328 SizeOfPredicates, 321 NumberOfNonLiveVariables, 5523 ConjunctsInSsa, 959 ConjunctsInUnsatCore, 30 InterpolantComputations, 12 PerfectInterpolantSequences, 196/412 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-12_06-45-13-955.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-12_06-45-13-955.csv Completed graceful shutdown