java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 15:56:55,733 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 15:56:55,735 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 15:56:55,748 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 15:56:55,748 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 15:56:55,749 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 15:56:55,750 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 15:56:55,751 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 15:56:55,753 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 15:56:55,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 15:56:55,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 15:56:55,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 15:56:55,755 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 15:56:55,756 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 15:56:55,756 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 15:56:55,758 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 15:56:55,759 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 15:56:55,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 15:56:55,761 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 15:56:55,762 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 15:56:55,764 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 15:56:55,764 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 15:56:55,764 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 15:56:55,765 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 15:56:55,766 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 15:56:55,767 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 15:56:55,767 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 15:56:55,767 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 15:56:55,768 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 15:56:55,768 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 15:56:55,768 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 15:56:55,769 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-10 15:56:55,784 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 15:56:55,785 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 15:56:55,785 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 15:56:55,786 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 15:56:55,786 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 15:56:55,786 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 15:56:55,786 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 15:56:55,786 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 15:56:55,786 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 15:56:55,786 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 15:56:55,787 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 15:56:55,787 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 15:56:55,787 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 15:56:55,787 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 15:56:55,787 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 15:56:55,787 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 15:56:55,787 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 15:56:55,788 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 15:56:55,788 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 15:56:55,788 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 15:56:55,788 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 15:56:55,788 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 15:56:55,788 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 15:56:55,788 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 15:56:55,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 15:56:55,824 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 15:56:55,827 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 15:56:55,828 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 15:56:55,828 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 15:56:55,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,140 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfe4276e8f [2018-04-10 15:56:56,264 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 15:56:56,264 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 15:56:56,265 INFO L168 CDTParser]: Scanning complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,273 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 15:56:56,273 INFO L215 ultiparseSymbolTable]: [2018-04-10 15:56:56,273 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 15:56:56,273 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeData ('freeData') in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,273 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data ('create_data') in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,273 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__append ('append') in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,273 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____bswap_32 ('__bswap_32') in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,274 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____bswap_64 ('__bswap_64') in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,274 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,274 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 15:56:56,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____int64_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__nlink_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_attr_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____fd_mask in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____uid_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_once_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____useconds_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____fsword_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_int8_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____uint64_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____u_int in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__wchar_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__timer_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____sig_atomic_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____clock_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____int8_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__register_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____daddr_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__clockid_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____uint8_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__fsid_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____key_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__ldiv_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_condattr_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____fsblkcnt64_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__int64_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_int64_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__loff_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____pid_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____mode_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_long in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____quad_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____fsid_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__size_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pid_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____intptr_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_barrier_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____u_quad_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__suseconds_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____u_short in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__clock_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____loff_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__off_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__daddr_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____socklen_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__mode_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__ulong in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____clockid_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_int16_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__blkcnt_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__quad_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_char in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_spinlock_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____int16_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_cond_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__gid_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__div_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____u_long in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____uint32_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____ino_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_short in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____sigset_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__caddr_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_key_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____qaddr_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__blksize_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____u_char in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____off64_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____blksize_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____caddr_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__fd_set in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____syscall_ulong_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____id_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_rwlock_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__lldiv_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_int32_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__uid_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__int16_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_barrierattr_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__Data in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____dev_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____fsblkcnt_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____int32_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____pthread_slist_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____suseconds_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__fsblkcnt_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____rlim_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____fsfilcnt_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____rlim64_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_quad_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____uint16_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_int in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_mutexattr_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____ino64_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____off_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____time_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__int8_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____gid_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____timer_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,283 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__fsfilcnt_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__ushort in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__ino_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__fd_mask in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_mutex_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____fsfilcnt64_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__int32_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____nlink_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____ssize_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____syscall_slong_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__key_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__time_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____blkcnt_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__dev_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____blkcnt64_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_rwlockattr_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,284 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__id_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,285 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__ssize_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,285 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__uint in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,285 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__sigset_t in complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:56,296 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfe4276e8f [2018-04-10 15:56:56,299 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 15:56:56,300 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 15:56:56,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 15:56:56,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 15:56:56,304 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 15:56:56,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:56:56" (1/1) ... [2018-04-10 15:56:56,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e85043a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:56:56, skipping insertion in model container [2018-04-10 15:56:56,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:56:56" (1/1) ... [2018-04-10 15:56:56,319 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:56:56,341 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:56:56,470 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:56:56,513 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:56:56,519 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 120 non ball SCCs. Number of states in SCCs 120. [2018-04-10 15:56:56,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:56:56 WrapperNode [2018-04-10 15:56:56,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 15:56:56,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 15:56:56,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 15:56:56,562 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 15:56:56,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:56:56" (1/1) ... [2018-04-10 15:56:56,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:56:56" (1/1) ... [2018-04-10 15:56:56,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:56:56" (1/1) ... [2018-04-10 15:56:56,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:56:56" (1/1) ... [2018-04-10 15:56:56,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:56:56" (1/1) ... [2018-04-10 15:56:56,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:56:56" (1/1) ... [2018-04-10 15:56:56,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:56:56" (1/1) ... [2018-04-10 15:56:56,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 15:56:56,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 15:56:56,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 15:56:56,611 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 15:56:56,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:56:56" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 15:56:56,699 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 15:56:56,700 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 15:56:56,700 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____bswap_32 [2018-04-10 15:56:56,700 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____bswap_64 [2018-04-10 15:56:56,700 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data [2018-04-10 15:56:56,700 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeData [2018-04-10 15:56:56,700 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__append [2018-04-10 15:56:56,700 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 15:56:56,700 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 15:56:56,700 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 15:56:56,701 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 15:56:56,701 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 15:56:56,701 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 15:56:56,701 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 15:56:56,701 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 15:56:56,701 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 15:56:56,701 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 15:56:56,701 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 15:56:56,701 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 15:56:56,702 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 15:56:56,702 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 15:56:56,702 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 15:56:56,702 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 15:56:56,702 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 15:56:56,702 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 15:56:56,702 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____bswap_32 [2018-04-10 15:56:56,702 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____bswap_64 [2018-04-10 15:56:56,702 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 15:56:56,702 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 15:56:56,703 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 15:56:56,703 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 15:56:56,703 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 15:56:56,703 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 15:56:56,703 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 15:56:56,703 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 15:56:56,703 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 15:56:56,703 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 15:56:56,703 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 15:56:56,703 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 15:56:56,703 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 15:56:56,704 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 15:56:56,704 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 15:56:56,704 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 15:56:56,704 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 15:56:56,704 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 15:56:56,704 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 15:56:56,704 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 15:56:56,704 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 15:56:56,704 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 15:56:56,704 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 15:56:56,705 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 15:56:56,705 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 15:56:56,705 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 15:56:56,705 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 15:56:56,705 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 15:56:56,705 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 15:56:56,705 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 15:56:56,705 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 15:56:56,705 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 15:56:56,705 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 15:56:56,706 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 15:56:56,706 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 15:56:56,706 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 15:56:56,706 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 15:56:56,706 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 15:56:56,706 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 15:56:56,706 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 15:56:56,706 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 15:56:56,706 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 15:56:56,706 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 15:56:56,707 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 15:56:56,707 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 15:56:56,707 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 15:56:56,707 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 15:56:56,707 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 15:56:56,707 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 15:56:56,707 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 15:56:56,707 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 15:56:56,707 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 15:56:56,707 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 15:56:56,708 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 15:56:56,708 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 15:56:56,708 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 15:56:56,708 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 15:56:56,708 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 15:56:56,708 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 15:56:56,708 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 15:56:56,708 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 15:56:56,708 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 15:56:56,708 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 15:56:56,709 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 15:56:56,709 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 15:56:56,709 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 15:56:56,709 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 15:56:56,709 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 15:56:56,709 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 15:56:56,709 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 15:56:56,709 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 15:56:56,709 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 15:56:56,709 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 15:56:56,710 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 15:56:56,710 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 15:56:56,710 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 15:56:56,710 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 15:56:56,710 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 15:56:56,710 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 15:56:56,710 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 15:56:56,710 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 15:56:56,710 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 15:56:56,710 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 15:56:56,710 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 15:56:56,711 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 15:56:56,711 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 15:56:56,711 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 15:56:56,711 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 15:56:56,711 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data [2018-04-10 15:56:56,711 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 15:56:56,711 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 15:56:56,711 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 15:56:56,711 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 15:56:56,711 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 15:56:56,712 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeData [2018-04-10 15:56:56,712 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 15:56:56,712 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__append [2018-04-10 15:56:56,712 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 15:56:56,712 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 15:56:56,712 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 15:56:56,712 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 15:56:57,185 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 15:56:57,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:56:57 BoogieIcfgContainer [2018-04-10 15:56:57,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 15:56:57,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 15:56:57,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 15:56:57,188 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 15:56:57,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 03:56:56" (1/3) ... [2018-04-10 15:56:57,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfde9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:56:57, skipping insertion in model container [2018-04-10 15:56:57,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:56:56" (2/3) ... [2018-04-10 15:56:57,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfde9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:56:57, skipping insertion in model container [2018-04-10 15:56:57,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:56:57" (3/3) ... [2018-04-10 15:56:57,191 INFO L107 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02_false-valid-memtrack.i [2018-04-10 15:56:57,197 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 15:56:57,203 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-04-10 15:56:57,229 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 15:56:57,229 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 15:56:57,229 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 15:56:57,229 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 15:56:57,229 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 15:56:57,229 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 15:56:57,229 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 15:56:57,230 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 15:56:57,230 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 15:56:57,230 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 15:56:57,243 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states. [2018-04-10 15:56:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-10 15:56:57,249 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:56:57,250 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:56:57,251 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:56:57,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1305984061, now seen corresponding path program 1 times [2018-04-10 15:56:57,256 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:56:57,256 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:56:57,288 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:57,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:57,288 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:57,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:56:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:56:57,352 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:56:57,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 15:56:57,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 15:56:57,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 15:56:57,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:56:57,363 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 3 states. [2018-04-10 15:56:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:56:57,516 INFO L93 Difference]: Finished difference Result 216 states and 228 transitions. [2018-04-10 15:56:57,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 15:56:57,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-10 15:56:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:56:57,524 INFO L225 Difference]: With dead ends: 216 [2018-04-10 15:56:57,524 INFO L226 Difference]: Without dead ends: 213 [2018-04-10 15:56:57,526 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:56:57,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-10 15:56:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-04-10 15:56:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-10 15:56:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 225 transitions. [2018-04-10 15:56:57,561 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 225 transitions. Word has length 7 [2018-04-10 15:56:57,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:56:57,561 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 225 transitions. [2018-04-10 15:56:57,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 15:56:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 225 transitions. [2018-04-10 15:56:57,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-10 15:56:57,561 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:56:57,561 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:56:57,562 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:56:57,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1305984062, now seen corresponding path program 1 times [2018-04-10 15:56:57,562 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:56:57,562 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:56:57,562 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:57,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:57,562 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:57,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:56:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:56:57,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:56:57,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 15:56:57,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 15:56:57,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 15:56:57,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:56:57,600 INFO L87 Difference]: Start difference. First operand 213 states and 225 transitions. Second operand 3 states. [2018-04-10 15:56:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:56:57,714 INFO L93 Difference]: Finished difference Result 214 states and 227 transitions. [2018-04-10 15:56:57,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 15:56:57,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-10 15:56:57,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:56:57,717 INFO L225 Difference]: With dead ends: 214 [2018-04-10 15:56:57,717 INFO L226 Difference]: Without dead ends: 214 [2018-04-10 15:56:57,718 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:56:57,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-10 15:56:57,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-04-10 15:56:57,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-10 15:56:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 224 transitions. [2018-04-10 15:56:57,729 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 224 transitions. Word has length 7 [2018-04-10 15:56:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:56:57,729 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 224 transitions. [2018-04-10 15:56:57,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 15:56:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 224 transitions. [2018-04-10 15:56:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-10 15:56:57,730 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:56:57,730 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:56:57,730 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:56:57,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1668679851, now seen corresponding path program 1 times [2018-04-10 15:56:57,730 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:56:57,731 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:56:57,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:57,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:57,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:57,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:56:57,753 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:56:57,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:56:57,753 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:56:57,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:57,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:56:57,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:57,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:57,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:57,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 15:56:57,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 15:56:57,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:57,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:57,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-10 15:56:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:56:57,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:56:57,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:56:57,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:56:57,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:56:57,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:56:57,842 INFO L87 Difference]: Start difference. First operand 212 states and 224 transitions. Second operand 5 states. [2018-04-10 15:56:58,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:56:58,055 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2018-04-10 15:56:58,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:56:58,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-10 15:56:58,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:56:58,057 INFO L225 Difference]: With dead ends: 210 [2018-04-10 15:56:58,057 INFO L226 Difference]: Without dead ends: 210 [2018-04-10 15:56:58,058 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:56:58,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-10 15:56:58,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-04-10 15:56:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-10 15:56:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 222 transitions. [2018-04-10 15:56:58,066 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 222 transitions. Word has length 14 [2018-04-10 15:56:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:56:58,066 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 222 transitions. [2018-04-10 15:56:58,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:56:58,066 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 222 transitions. [2018-04-10 15:56:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-10 15:56:58,066 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:56:58,067 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:56:58,067 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:56:58,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1668679850, now seen corresponding path program 1 times [2018-04-10 15:56:58,067 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:56:58,067 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:56:58,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:58,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:58,068 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:58,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:56:58,086 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:56:58,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:56:58,086 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:56:58,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:58,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:56:58,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:58,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:58,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:56:58,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:58,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:58,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 15:56:58,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:58,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-10 15:56:58,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:58,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-10 15:56:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:56:58,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:56:58,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 15:56:58,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:56:58,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:56:58,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:56:58,179 INFO L87 Difference]: Start difference. First operand 210 states and 222 transitions. Second operand 6 states. [2018-04-10 15:56:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:56:58,489 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2018-04-10 15:56:58,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:56:58,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-04-10 15:56:58,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:56:58,491 INFO L225 Difference]: With dead ends: 230 [2018-04-10 15:56:58,491 INFO L226 Difference]: Without dead ends: 230 [2018-04-10 15:56:58,491 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:56:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-10 15:56:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 219. [2018-04-10 15:56:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-10 15:56:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2018-04-10 15:56:58,498 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 14 [2018-04-10 15:56:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:56:58,498 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2018-04-10 15:56:58,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:56:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2018-04-10 15:56:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 15:56:58,499 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:56:58,499 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:56:58,499 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:56:58,499 INFO L82 PathProgramCache]: Analyzing trace with hash -189467591, now seen corresponding path program 1 times [2018-04-10 15:56:58,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:56:58,500 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:56:58,500 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:58,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:58,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:58,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:56:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:56:58,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:56:58,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:56:58,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:56:58,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:56:58,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:56:58,526 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand 4 states. [2018-04-10 15:56:58,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:56:58,627 INFO L93 Difference]: Finished difference Result 217 states and 231 transitions. [2018-04-10 15:56:58,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:56:58,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-10 15:56:58,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:56:58,630 INFO L225 Difference]: With dead ends: 217 [2018-04-10 15:56:58,630 INFO L226 Difference]: Without dead ends: 217 [2018-04-10 15:56:58,630 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:56:58,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-10 15:56:58,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-04-10 15:56:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-10 15:56:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 231 transitions. [2018-04-10 15:56:58,636 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 231 transitions. Word has length 15 [2018-04-10 15:56:58,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:56:58,636 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 231 transitions. [2018-04-10 15:56:58,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:56:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 231 transitions. [2018-04-10 15:56:58,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 15:56:58,636 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:56:58,636 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:56:58,636 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:56:58,637 INFO L82 PathProgramCache]: Analyzing trace with hash -189467590, now seen corresponding path program 1 times [2018-04-10 15:56:58,637 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:56:58,637 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:56:58,637 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:58,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:58,637 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:58,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:56:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:56:58,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:56:58,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:56:58,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:56:58,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:56:58,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:56:58,671 INFO L87 Difference]: Start difference. First operand 217 states and 231 transitions. Second operand 4 states. [2018-04-10 15:56:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:56:58,778 INFO L93 Difference]: Finished difference Result 215 states and 228 transitions. [2018-04-10 15:56:58,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:56:58,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-10 15:56:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:56:58,780 INFO L225 Difference]: With dead ends: 215 [2018-04-10 15:56:58,780 INFO L226 Difference]: Without dead ends: 215 [2018-04-10 15:56:58,780 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:56:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-10 15:56:58,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-04-10 15:56:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-10 15:56:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 228 transitions. [2018-04-10 15:56:58,783 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 228 transitions. Word has length 15 [2018-04-10 15:56:58,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:56:58,783 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 228 transitions. [2018-04-10 15:56:58,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:56:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 228 transitions. [2018-04-10 15:56:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-10 15:56:58,790 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:56:58,790 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:56:58,790 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:56:58,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1455570169, now seen corresponding path program 1 times [2018-04-10 15:56:58,790 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:56:58,790 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:56:58,791 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:58,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:58,791 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:58,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:56:58,807 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:56:58,807 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:56:58,807 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:56:58,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:58,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:56:58,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:58,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,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-10 15:56:58,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:56:58,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:56:58,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:56:58,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:56:58,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:56:58,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-04-10 15:56:58,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:58,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:58,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 15:56:58,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:58,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-10 15:56:58,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-10 15:56:58,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:58,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:58,954 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 18 treesize of output 8 [2018-04-10 15:56:58,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:58,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:25 [2018-04-10 15:56:58,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-10 15:56:58,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:56:58,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:59,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:59,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-10 15:56:59,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 10 treesize of output 9 [2018-04-10 15:56:59,013 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:59,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:59,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:59,023 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:51, output treesize:21 [2018-04-10 15:56:59,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 15:56:59,043 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:59,043 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 11 treesize of output 7 [2018-04-10 15:56:59,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:59,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:59,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 15:56:59,051 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:59,051 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 11 treesize of output 7 [2018-04-10 15:56:59,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:59,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:59,057 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-10 15:56:59,057 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-04-10 15:56:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:56:59,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:56:59,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-10 15:56:59,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:56:59,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:56:59,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:56:59,068 INFO L87 Difference]: Start difference. First operand 215 states and 228 transitions. Second operand 11 states. [2018-04-10 15:56:59,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:56:59,594 INFO L93 Difference]: Finished difference Result 217 states and 231 transitions. [2018-04-10 15:56:59,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 15:56:59,594 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-04-10 15:56:59,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:56:59,595 INFO L225 Difference]: With dead ends: 217 [2018-04-10 15:56:59,596 INFO L226 Difference]: Without dead ends: 217 [2018-04-10 15:56:59,596 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-04-10 15:56:59,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-10 15:56:59,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-04-10 15:56:59,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-10 15:56:59,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 229 transitions. [2018-04-10 15:56:59,601 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 229 transitions. Word has length 20 [2018-04-10 15:56:59,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:56:59,601 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 229 transitions. [2018-04-10 15:56:59,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:56:59,602 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 229 transitions. [2018-04-10 15:56:59,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 15:56:59,602 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:56:59,602 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] [2018-04-10 15:56:59,602 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:56:59,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1350408584, now seen corresponding path program 1 times [2018-04-10 15:56:59,603 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:56:59,603 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:56:59,603 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:59,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:59,604 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:59,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:56:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:56:59,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:56:59,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:56:59,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:56:59,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:56:59,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:56:59,652 INFO L87 Difference]: Start difference. First operand 216 states and 229 transitions. Second operand 4 states. [2018-04-10 15:56:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:56:59,674 INFO L93 Difference]: Finished difference Result 304 states and 321 transitions. [2018-04-10 15:56:59,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:56:59,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-04-10 15:56:59,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:56:59,676 INFO L225 Difference]: With dead ends: 304 [2018-04-10 15:56:59,676 INFO L226 Difference]: Without dead ends: 304 [2018-04-10 15:56:59,676 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:56:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-04-10 15:56:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 268. [2018-04-10 15:56:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-10 15:56:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 321 transitions. [2018-04-10 15:56:59,682 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 321 transitions. Word has length 22 [2018-04-10 15:56:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:56:59,682 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 321 transitions. [2018-04-10 15:56:59,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:56:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 321 transitions. [2018-04-10 15:56:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 15:56:59,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:56:59,683 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] [2018-04-10 15:56:59,683 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:56:59,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1216531346, now seen corresponding path program 1 times [2018-04-10 15:56:59,684 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:56:59,684 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:56:59,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:59,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:59,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:59,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:56:59,696 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:56:59,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:56:59,696 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:56:59,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:59,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:56:59,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:59,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:59,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:59,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 15:56:59,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 15:56:59,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:59,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:59,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-10 15:56:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:56:59,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:56:59,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:56:59,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:56:59,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:56:59,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:56:59,751 INFO L87 Difference]: Start difference. First operand 268 states and 321 transitions. Second operand 4 states. [2018-04-10 15:56:59,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:56:59,907 INFO L93 Difference]: Finished difference Result 281 states and 327 transitions. [2018-04-10 15:56:59,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:56:59,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-10 15:56:59,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:56:59,908 INFO L225 Difference]: With dead ends: 281 [2018-04-10 15:56:59,908 INFO L226 Difference]: Without dead ends: 281 [2018-04-10 15:56:59,908 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:56:59,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-10 15:56:59,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 270. [2018-04-10 15:56:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-04-10 15:56:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 319 transitions. [2018-04-10 15:56:59,912 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 319 transitions. Word has length 26 [2018-04-10 15:56:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:56:59,912 INFO L459 AbstractCegarLoop]: Abstraction has 270 states and 319 transitions. [2018-04-10 15:56:59,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:56:59,912 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 319 transitions. [2018-04-10 15:56:59,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 15:56:59,913 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:56:59,913 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] [2018-04-10 15:56:59,913 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:56:59,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1216531347, now seen corresponding path program 1 times [2018-04-10 15:56:59,913 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:56:59,913 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:56:59,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:59,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:59,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:59,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:56:59,921 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:56:59,921 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:56:59,921 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:56:59,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:59,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:56:59,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:59,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:59,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:59,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:59,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:59,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:56:59,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:59,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:59,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-10 15:56:59,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:59,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:59,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:59,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 15:56:59,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:00,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:00,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-10 15:57:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:57:00,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:00,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:57:00,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:57:00,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:57:00,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:00,010 INFO L87 Difference]: Start difference. First operand 270 states and 319 transitions. Second operand 5 states. [2018-04-10 15:57:00,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:00,216 INFO L93 Difference]: Finished difference Result 293 states and 335 transitions. [2018-04-10 15:57:00,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:57:00,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-04-10 15:57:00,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:00,218 INFO L225 Difference]: With dead ends: 293 [2018-04-10 15:57:00,218 INFO L226 Difference]: Without dead ends: 293 [2018-04-10 15:57:00,218 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:57:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-10 15:57:00,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 271. [2018-04-10 15:57:00,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-10 15:57:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 313 transitions. [2018-04-10 15:57:00,225 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 313 transitions. Word has length 26 [2018-04-10 15:57:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:00,225 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 313 transitions. [2018-04-10 15:57:00,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:57:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 313 transitions. [2018-04-10 15:57:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 15:57:00,226 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:00,226 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:00,226 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:00,226 INFO L82 PathProgramCache]: Analyzing trace with hash 314042552, now seen corresponding path program 1 times [2018-04-10 15:57:00,226 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:00,227 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:00,227 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:00,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:00,227 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:00,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:57:00,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:00,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:57:00,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:57:00,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:57:00,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:00,279 INFO L87 Difference]: Start difference. First operand 271 states and 313 transitions. Second operand 5 states. [2018-04-10 15:57:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:00,463 INFO L93 Difference]: Finished difference Result 280 states and 319 transitions. [2018-04-10 15:57:00,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:57:00,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-04-10 15:57:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:00,465 INFO L225 Difference]: With dead ends: 280 [2018-04-10 15:57:00,466 INFO L226 Difference]: Without dead ends: 280 [2018-04-10 15:57:00,466 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:57:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-04-10 15:57:00,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2018-04-10 15:57:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-04-10 15:57:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 311 transitions. [2018-04-10 15:57:00,473 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 311 transitions. Word has length 32 [2018-04-10 15:57:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:00,473 INFO L459 AbstractCegarLoop]: Abstraction has 270 states and 311 transitions. [2018-04-10 15:57:00,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:57:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 311 transitions. [2018-04-10 15:57:00,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 15:57:00,474 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:00,474 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:00,474 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:00,474 INFO L82 PathProgramCache]: Analyzing trace with hash 314042553, now seen corresponding path program 1 times [2018-04-10 15:57:00,475 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:00,475 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:00,475 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:00,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:00,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:00,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:57:00,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:00,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 15:57:00,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:57:00,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:57:00,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:57:00,551 INFO L87 Difference]: Start difference. First operand 270 states and 311 transitions. Second operand 6 states. [2018-04-10 15:57:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:00,703 INFO L93 Difference]: Finished difference Result 290 states and 331 transitions. [2018-04-10 15:57:00,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:57:00,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-10 15:57:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:00,705 INFO L225 Difference]: With dead ends: 290 [2018-04-10 15:57:00,705 INFO L226 Difference]: Without dead ends: 290 [2018-04-10 15:57:00,705 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-10 15:57:00,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-04-10 15:57:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2018-04-10 15:57:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-04-10 15:57:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 321 transitions. [2018-04-10 15:57:00,709 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 321 transitions. Word has length 32 [2018-04-10 15:57:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:00,709 INFO L459 AbstractCegarLoop]: Abstraction has 280 states and 321 transitions. [2018-04-10 15:57:00,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:57:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 321 transitions. [2018-04-10 15:57:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-10 15:57:00,710 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:00,710 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] [2018-04-10 15:57:00,710 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:00,711 INFO L82 PathProgramCache]: Analyzing trace with hash 244172232, now seen corresponding path program 1 times [2018-04-10 15:57:00,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:00,711 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:00,711 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:00,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:00,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:00,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:00,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:57:00,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:00,838 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:00,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:00,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:00,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:00,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:00,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:00,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:57:00,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 15:57:00,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:57:00,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:00,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:00,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 15:57:00,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:57:00,929 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:00,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:00,936 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-10 15:57:00,936 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:21 [2018-04-10 15:57:01,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-10 15:57:01,027 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 17 treesize of output 5 [2018-04-10 15:57:01,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:01,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:01,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-04-10 15:57:01,041 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 26 treesize of output 11 [2018-04-10 15:57:01,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:01,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:01,050 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-10 15:57:01,050 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:19 [2018-04-10 15:57:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:57:01,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:57:01,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-04-10 15:57:01,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 15:57:01,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 15:57:01,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-04-10 15:57:01,073 INFO L87 Difference]: Start difference. First operand 280 states and 321 transitions. Second operand 16 states. [2018-04-10 15:57:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:01,639 INFO L93 Difference]: Finished difference Result 307 states and 347 transitions. [2018-04-10 15:57:01,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:57:01,640 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-04-10 15:57:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:01,641 INFO L225 Difference]: With dead ends: 307 [2018-04-10 15:57:01,641 INFO L226 Difference]: Without dead ends: 307 [2018-04-10 15:57:01,642 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-04-10 15:57:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-10 15:57:01,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2018-04-10 15:57:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-04-10 15:57:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 341 transitions. [2018-04-10 15:57:01,647 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 341 transitions. Word has length 39 [2018-04-10 15:57:01,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:01,647 INFO L459 AbstractCegarLoop]: Abstraction has 301 states and 341 transitions. [2018-04-10 15:57:01,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 15:57:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 341 transitions. [2018-04-10 15:57:01,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-10 15:57:01,648 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:01,648 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:01,648 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:01,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2014841809, now seen corresponding path program 1 times [2018-04-10 15:57:01,649 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:01,649 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:01,649 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:01,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:01,649 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:01,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:01,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:01,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:57:01,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:57:01,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:57:01,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:57:01,715 INFO L87 Difference]: Start difference. First operand 301 states and 341 transitions. Second operand 4 states. [2018-04-10 15:57:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:01,924 INFO L93 Difference]: Finished difference Result 303 states and 335 transitions. [2018-04-10 15:57:01,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:57:01,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-04-10 15:57:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:01,925 INFO L225 Difference]: With dead ends: 303 [2018-04-10 15:57:01,925 INFO L226 Difference]: Without dead ends: 303 [2018-04-10 15:57:01,926 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-04-10 15:57:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2018-04-10 15:57:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-10 15:57:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 329 transitions. [2018-04-10 15:57:01,929 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 329 transitions. Word has length 66 [2018-04-10 15:57:01,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:01,929 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 329 transitions. [2018-04-10 15:57:01,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:57:01,929 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 329 transitions. [2018-04-10 15:57:01,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-10 15:57:01,930 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:01,930 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:01,930 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:01,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2014841808, now seen corresponding path program 1 times [2018-04-10 15:57:01,930 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:01,930 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:01,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:01,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:01,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:01,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:01,968 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:01,968 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:01,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:57:01,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:57:01,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:57:01,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:57:01,969 INFO L87 Difference]: Start difference. First operand 297 states and 329 transitions. Second operand 4 states. [2018-04-10 15:57:02,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:02,105 INFO L93 Difference]: Finished difference Result 299 states and 323 transitions. [2018-04-10 15:57:02,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:57:02,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-04-10 15:57:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:02,107 INFO L225 Difference]: With dead ends: 299 [2018-04-10 15:57:02,107 INFO L226 Difference]: Without dead ends: 299 [2018-04-10 15:57:02,107 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-04-10 15:57:02,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 293. [2018-04-10 15:57:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-10 15:57:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 317 transitions. [2018-04-10 15:57:02,112 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 317 transitions. Word has length 66 [2018-04-10 15:57:02,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:02,112 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 317 transitions. [2018-04-10 15:57:02,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:57:02,113 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 317 transitions. [2018-04-10 15:57:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 15:57:02,113 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:02,113 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:02,114 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:02,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1963525987, now seen corresponding path program 1 times [2018-04-10 15:57:02,114 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:02,114 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:02,115 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:02,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:02,115 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:02,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:02,152 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:02,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:02,152 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:02,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:02,178 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:02,192 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0))) is different from true [2018-04-10 15:57:02,197 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0))) is different from true [2018-04-10 15:57:02,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:02,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:02,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2018-04-10 15:57:02,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-10 15:57:02,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:02,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:02,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:02,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-04-10 15:57:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:02,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:02,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 15:57:02,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:57:02,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:57:02,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2018-04-10 15:57:02,279 INFO L87 Difference]: Start difference. First operand 293 states and 317 transitions. Second operand 7 states. [2018-04-10 15:57:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:02,485 INFO L93 Difference]: Finished difference Result 333 states and 366 transitions. [2018-04-10 15:57:02,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:57:02,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-04-10 15:57:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:02,487 INFO L225 Difference]: With dead ends: 333 [2018-04-10 15:57:02,487 INFO L226 Difference]: Without dead ends: 333 [2018-04-10 15:57:02,487 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2018-04-10 15:57:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-10 15:57:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 311. [2018-04-10 15:57:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-04-10 15:57:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 341 transitions. [2018-04-10 15:57:02,493 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 341 transitions. Word has length 67 [2018-04-10 15:57:02,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:02,493 INFO L459 AbstractCegarLoop]: Abstraction has 311 states and 341 transitions. [2018-04-10 15:57:02,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:57:02,493 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 341 transitions. [2018-04-10 15:57:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 15:57:02,494 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:02,494 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:02,494 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:02,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1963525988, now seen corresponding path program 1 times [2018-04-10 15:57:02,495 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:02,495 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:02,495 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:02,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:02,495 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:02,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:02,517 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:02,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:02,517 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:02,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:02,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:02,566 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |c_#length|))) is different from true [2018-04-10 15:57:02,570 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:57:02,574 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:57:02,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:02,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:02,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 15:57:02,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:02,620 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-04-10 15:57:02,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:02,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 33 [2018-04-10 15:57:02,638 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-10 15:57:02,658 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:02,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:02,669 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:46 [2018-04-10 15:57:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:02,694 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:02,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 15:57:02,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 15:57:02,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 15:57:02,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=32, Unknown=3, NotChecked=36, Total=90 [2018-04-10 15:57:02,695 INFO L87 Difference]: Start difference. First operand 311 states and 341 transitions. Second operand 10 states. [2018-04-10 15:57:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:02,919 INFO L93 Difference]: Finished difference Result 346 states and 379 transitions. [2018-04-10 15:57:02,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:57:02,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-04-10 15:57:02,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:02,920 INFO L225 Difference]: With dead ends: 346 [2018-04-10 15:57:02,920 INFO L226 Difference]: Without dead ends: 346 [2018-04-10 15:57:02,920 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=65, Unknown=3, NotChecked=54, Total=156 [2018-04-10 15:57:02,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-10 15:57:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 330. [2018-04-10 15:57:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-04-10 15:57:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 366 transitions. [2018-04-10 15:57:02,926 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 366 transitions. Word has length 67 [2018-04-10 15:57:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:02,926 INFO L459 AbstractCegarLoop]: Abstraction has 330 states and 366 transitions. [2018-04-10 15:57:02,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 15:57:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 366 transitions. [2018-04-10 15:57:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-10 15:57:02,927 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:02,927 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:02,927 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:02,927 INFO L82 PathProgramCache]: Analyzing trace with hash -528083168, now seen corresponding path program 1 times [2018-04-10 15:57:02,927 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:02,927 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:02,927 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:02,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:02,928 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:02,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:02,956 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:02,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:02,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:57:02,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:57:02,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:57:02,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:57:02,956 INFO L87 Difference]: Start difference. First operand 330 states and 366 transitions. Second operand 4 states. [2018-04-10 15:57:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:02,968 INFO L93 Difference]: Finished difference Result 338 states and 370 transitions. [2018-04-10 15:57:02,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:57:02,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-04-10 15:57:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:02,969 INFO L225 Difference]: With dead ends: 338 [2018-04-10 15:57:02,970 INFO L226 Difference]: Without dead ends: 338 [2018-04-10 15:57:02,970 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:02,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-04-10 15:57:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2018-04-10 15:57:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-04-10 15:57:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 368 transitions. [2018-04-10 15:57:02,976 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 368 transitions. Word has length 69 [2018-04-10 15:57:02,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:02,976 INFO L459 AbstractCegarLoop]: Abstraction has 336 states and 368 transitions. [2018-04-10 15:57:02,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:57:02,976 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 368 transitions. [2018-04-10 15:57:02,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-10 15:57:02,977 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:02,977 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:02,977 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:02,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1457838642, now seen corresponding path program 1 times [2018-04-10 15:57:02,977 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:02,977 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:02,978 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:02,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:02,978 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:02,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:02,991 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:02,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:02,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:02,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:03,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:03,028 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)))) is different from true [2018-04-10 15:57:03,031 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)) (= |c_#valid| (store (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)))) is different from true [2018-04-10 15:57:03,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:03,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:03,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 15:57:03,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-04-10 15:57:03,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:03,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:03,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:03,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-04-10 15:57:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:03,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:03,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 15:57:03,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:57:03,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:57:03,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2018-04-10 15:57:03,106 INFO L87 Difference]: Start difference. First operand 336 states and 368 transitions. Second operand 7 states. [2018-04-10 15:57:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:03,221 INFO L93 Difference]: Finished difference Result 344 states and 377 transitions. [2018-04-10 15:57:03,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:57:03,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-04-10 15:57:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:03,223 INFO L225 Difference]: With dead ends: 344 [2018-04-10 15:57:03,223 INFO L226 Difference]: Without dead ends: 344 [2018-04-10 15:57:03,224 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2018-04-10 15:57:03,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-10 15:57:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 340. [2018-04-10 15:57:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-04-10 15:57:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 374 transitions. [2018-04-10 15:57:03,230 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 374 transitions. Word has length 69 [2018-04-10 15:57:03,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:03,230 INFO L459 AbstractCegarLoop]: Abstraction has 340 states and 374 transitions. [2018-04-10 15:57:03,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:57:03,230 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 374 transitions. [2018-04-10 15:57:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-10 15:57:03,231 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:03,231 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:03,231 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:03,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1457838643, now seen corresponding path program 1 times [2018-04-10 15:57:03,231 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:03,231 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:03,232 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:03,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:03,232 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:03,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:03,278 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:03,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:03,279 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:03,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:03,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:03,361 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |c_#length|))) is different from true [2018-04-10 15:57:03,363 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:57:03,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:03,382 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-04-10 15:57:03,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:03,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 33 [2018-04-10 15:57:03,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-10 15:57:03,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:03,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:03,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:03,447 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 15:57:03,448 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:03,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:03,465 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:52 [2018-04-10 15:57:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:03,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:03,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 15:57:03,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 15:57:03,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 15:57:03,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=43, Unknown=2, NotChecked=26, Total=90 [2018-04-10 15:57:03,505 INFO L87 Difference]: Start difference. First operand 340 states and 374 transitions. Second operand 10 states. [2018-04-10 15:57:03,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:03,756 INFO L93 Difference]: Finished difference Result 347 states and 376 transitions. [2018-04-10 15:57:03,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 15:57:03,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2018-04-10 15:57:03,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:03,758 INFO L225 Difference]: With dead ends: 347 [2018-04-10 15:57:03,758 INFO L226 Difference]: Without dead ends: 347 [2018-04-10 15:57:03,758 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=117, Unknown=2, NotChecked=46, Total=210 [2018-04-10 15:57:03,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-04-10 15:57:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 339. [2018-04-10 15:57:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-04-10 15:57:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 371 transitions. [2018-04-10 15:57:03,764 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 371 transitions. Word has length 69 [2018-04-10 15:57:03,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:03,764 INFO L459 AbstractCegarLoop]: Abstraction has 339 states and 371 transitions. [2018-04-10 15:57:03,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 15:57:03,764 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 371 transitions. [2018-04-10 15:57:03,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-10 15:57:03,765 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:03,765 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:03,765 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:03,765 INFO L82 PathProgramCache]: Analyzing trace with hash 499038400, now seen corresponding path program 1 times [2018-04-10 15:57:03,765 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:03,765 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:03,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:03,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:03,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:03,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:03,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:03,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 15:57:03,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:57:03,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:57:03,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:57:03,824 INFO L87 Difference]: Start difference. First operand 339 states and 371 transitions. Second operand 6 states. [2018-04-10 15:57:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:03,913 INFO L93 Difference]: Finished difference Result 385 states and 421 transitions. [2018-04-10 15:57:03,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:57:03,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-04-10 15:57:03,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:03,915 INFO L225 Difference]: With dead ends: 385 [2018-04-10 15:57:03,915 INFO L226 Difference]: Without dead ends: 385 [2018-04-10 15:57:03,915 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-10 15:57:03,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-04-10 15:57:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 347. [2018-04-10 15:57:03,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-04-10 15:57:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 379 transitions. [2018-04-10 15:57:03,922 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 379 transitions. Word has length 69 [2018-04-10 15:57:03,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:03,922 INFO L459 AbstractCegarLoop]: Abstraction has 347 states and 379 transitions. [2018-04-10 15:57:03,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:57:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 379 transitions. [2018-04-10 15:57:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-10 15:57:03,923 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:03,923 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:03,923 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:03,923 INFO L82 PathProgramCache]: Analyzing trace with hash 848618813, now seen corresponding path program 1 times [2018-04-10 15:57:03,923 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:03,923 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:03,924 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:03,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:03,924 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:03,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:03,943 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:03,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:03,943 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:03,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:03,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:03,987 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)))) is different from true [2018-04-10 15:57:03,990 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)) (= |c_#valid| (store (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)))) is different from true [2018-04-10 15:57:04,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:04,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:04,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 15:57:04,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-04-10 15:57:04,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:04,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:04,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:04,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-04-10 15:57:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:04,059 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:04,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 15:57:04,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:57:04,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:57:04,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=20, Unknown=2, NotChecked=18, Total=56 [2018-04-10 15:57:04,060 INFO L87 Difference]: Start difference. First operand 347 states and 379 transitions. Second operand 8 states. [2018-04-10 15:57:04,087 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__append_~pointerToList.base Int)) (= 1 (select |c_#valid| __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__append_~pointerToList.base))) (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|))))) is different from true [2018-04-10 15:57:04,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:04,237 INFO L93 Difference]: Finished difference Result 382 states and 419 transitions. [2018-04-10 15:57:04,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:57:04,239 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-04-10 15:57:04,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:04,240 INFO L225 Difference]: With dead ends: 382 [2018-04-10 15:57:04,240 INFO L226 Difference]: Without dead ends: 382 [2018-04-10 15:57:04,240 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=40, Unknown=3, NotChecked=42, Total=110 [2018-04-10 15:57:04,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-04-10 15:57:04,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 371. [2018-04-10 15:57:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-04-10 15:57:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 409 transitions. [2018-04-10 15:57:04,247 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 409 transitions. Word has length 71 [2018-04-10 15:57:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:04,247 INFO L459 AbstractCegarLoop]: Abstraction has 371 states and 409 transitions. [2018-04-10 15:57:04,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:57:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 409 transitions. [2018-04-10 15:57:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-10 15:57:04,248 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:04,248 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:04,248 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:04,248 INFO L82 PathProgramCache]: Analyzing trace with hash 848618814, now seen corresponding path program 1 times [2018-04-10 15:57:04,248 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:04,248 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:04,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:04,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:04,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:04,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:04,267 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:04,267 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:04,267 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:04,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:04,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:04,308 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |c_#length|))) is different from true [2018-04-10 15:57:04,311 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:57:04,314 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:57:04,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:04,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:04,340 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 15:57:04,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:04,348 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-04-10 15:57:04,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:04,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 33 [2018-04-10 15:57:04,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-10 15:57:04,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:04,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:04,397 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:46 [2018-04-10 15:57:04,433 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:04,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:04,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 15:57:04,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 15:57:04,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 15:57:04,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=32, Unknown=3, NotChecked=36, Total=90 [2018-04-10 15:57:04,434 INFO L87 Difference]: Start difference. First operand 371 states and 409 transitions. Second operand 10 states. [2018-04-10 15:57:04,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:04,695 INFO L93 Difference]: Finished difference Result 379 states and 417 transitions. [2018-04-10 15:57:04,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:57:04,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2018-04-10 15:57:04,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:04,697 INFO L225 Difference]: With dead ends: 379 [2018-04-10 15:57:04,697 INFO L226 Difference]: Without dead ends: 379 [2018-04-10 15:57:04,697 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=75, Unknown=3, NotChecked=60, Total=182 [2018-04-10 15:57:04,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-10 15:57:04,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 371. [2018-04-10 15:57:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-04-10 15:57:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 408 transitions. [2018-04-10 15:57:04,704 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 408 transitions. Word has length 71 [2018-04-10 15:57:04,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:04,704 INFO L459 AbstractCegarLoop]: Abstraction has 371 states and 408 transitions. [2018-04-10 15:57:04,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 15:57:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 408 transitions. [2018-04-10 15:57:04,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-10 15:57:04,705 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:04,705 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:04,705 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:04,705 INFO L82 PathProgramCache]: Analyzing trace with hash -238045128, now seen corresponding path program 1 times [2018-04-10 15:57:04,705 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:04,705 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:04,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:04,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:04,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:04,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:04,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:04,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:57:04,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:57:04,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:57:04,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:04,760 INFO L87 Difference]: Start difference. First operand 371 states and 408 transitions. Second operand 5 states. [2018-04-10 15:57:04,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:04,878 INFO L93 Difference]: Finished difference Result 370 states and 407 transitions. [2018-04-10 15:57:04,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:57:04,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-04-10 15:57:04,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:04,879 INFO L225 Difference]: With dead ends: 370 [2018-04-10 15:57:04,879 INFO L226 Difference]: Without dead ends: 370 [2018-04-10 15:57:04,879 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:57:04,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-04-10 15:57:04,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2018-04-10 15:57:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-04-10 15:57:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 407 transitions. [2018-04-10 15:57:04,883 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 407 transitions. Word has length 72 [2018-04-10 15:57:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:04,883 INFO L459 AbstractCegarLoop]: Abstraction has 370 states and 407 transitions. [2018-04-10 15:57:04,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:57:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 407 transitions. [2018-04-10 15:57:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-10 15:57:04,883 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:04,883 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:04,884 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:04,884 INFO L82 PathProgramCache]: Analyzing trace with hash -238045127, now seen corresponding path program 1 times [2018-04-10 15:57:04,884 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:04,884 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:04,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:04,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:04,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:04,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:04,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:04,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 15:57:04,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:57:04,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:57:04,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:57:04,945 INFO L87 Difference]: Start difference. First operand 370 states and 407 transitions. Second operand 6 states. [2018-04-10 15:57:05,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:05,110 INFO L93 Difference]: Finished difference Result 365 states and 402 transitions. [2018-04-10 15:57:05,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:57:05,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-04-10 15:57:05,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:05,112 INFO L225 Difference]: With dead ends: 365 [2018-04-10 15:57:05,112 INFO L226 Difference]: Without dead ends: 365 [2018-04-10 15:57:05,112 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:57:05,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-04-10 15:57:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2018-04-10 15:57:05,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-04-10 15:57:05,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 402 transitions. [2018-04-10 15:57:05,117 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 402 transitions. Word has length 72 [2018-04-10 15:57:05,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:05,118 INFO L459 AbstractCegarLoop]: Abstraction has 365 states and 402 transitions. [2018-04-10 15:57:05,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:57:05,118 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 402 transitions. [2018-04-10 15:57:05,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-10 15:57:05,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:05,119 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:05,119 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:05,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1210535772, now seen corresponding path program 1 times [2018-04-10 15:57:05,119 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:05,119 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:05,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:05,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:05,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:05,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:05,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:05,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 15:57:05,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:57:05,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:57:05,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:57:05,190 INFO L87 Difference]: Start difference. First operand 365 states and 402 transitions. Second operand 7 states. [2018-04-10 15:57:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:05,350 INFO L93 Difference]: Finished difference Result 379 states and 418 transitions. [2018-04-10 15:57:05,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 15:57:05,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-04-10 15:57:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:05,352 INFO L225 Difference]: With dead ends: 379 [2018-04-10 15:57:05,352 INFO L226 Difference]: Without dead ends: 379 [2018-04-10 15:57:05,352 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-10 15:57:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-10 15:57:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 364. [2018-04-10 15:57:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-04-10 15:57:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 401 transitions. [2018-04-10 15:57:05,357 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 401 transitions. Word has length 73 [2018-04-10 15:57:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:05,357 INFO L459 AbstractCegarLoop]: Abstraction has 364 states and 401 transitions. [2018-04-10 15:57:05,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:57:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 401 transitions. [2018-04-10 15:57:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-10 15:57:05,358 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:05,358 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:05,359 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:05,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1210535773, now seen corresponding path program 1 times [2018-04-10 15:57:05,359 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:05,359 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:05,360 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:05,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:05,360 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:05,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:05,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:05,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 15:57:05,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 15:57:05,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 15:57:05,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-10 15:57:05,473 INFO L87 Difference]: Start difference. First operand 364 states and 401 transitions. Second operand 9 states. [2018-04-10 15:57:05,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:05,693 INFO L93 Difference]: Finished difference Result 390 states and 429 transitions. [2018-04-10 15:57:05,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 15:57:05,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2018-04-10 15:57:05,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:05,694 INFO L225 Difference]: With dead ends: 390 [2018-04-10 15:57:05,694 INFO L226 Difference]: Without dead ends: 390 [2018-04-10 15:57:05,694 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-04-10 15:57:05,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-04-10 15:57:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 363. [2018-04-10 15:57:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-04-10 15:57:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 400 transitions. [2018-04-10 15:57:05,697 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 400 transitions. Word has length 73 [2018-04-10 15:57:05,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:05,697 INFO L459 AbstractCegarLoop]: Abstraction has 363 states and 400 transitions. [2018-04-10 15:57:05,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 15:57:05,697 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 400 transitions. [2018-04-10 15:57:05,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-10 15:57:05,698 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:05,698 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:05,698 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:05,698 INFO L82 PathProgramCache]: Analyzing trace with hash -521098868, now seen corresponding path program 1 times [2018-04-10 15:57:05,698 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:05,698 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:05,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:05,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:05,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:05,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:05,709 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:05,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:05,710 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:05,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:05,727 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:05,745 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)))) is different from true [2018-04-10 15:57:05,747 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)) (= |c_#valid| (store (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)))) is different from true [2018-04-10 15:57:05,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:05,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:05,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 15:57:05,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-04-10 15:57:05,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:05,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:05,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:05,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-04-10 15:57:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:05,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:05,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 15:57:05,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:57:05,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:57:05,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2018-04-10 15:57:05,811 INFO L87 Difference]: Start difference. First operand 363 states and 400 transitions. Second operand 7 states. [2018-04-10 15:57:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:05,930 INFO L93 Difference]: Finished difference Result 368 states and 406 transitions. [2018-04-10 15:57:05,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:57:05,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-04-10 15:57:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:05,932 INFO L225 Difference]: With dead ends: 368 [2018-04-10 15:57:05,932 INFO L226 Difference]: Without dead ends: 368 [2018-04-10 15:57:05,932 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2018-04-10 15:57:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-10 15:57:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 365. [2018-04-10 15:57:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-04-10 15:57:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 403 transitions. [2018-04-10 15:57:05,937 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 403 transitions. Word has length 73 [2018-04-10 15:57:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:05,937 INFO L459 AbstractCegarLoop]: Abstraction has 365 states and 403 transitions. [2018-04-10 15:57:05,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:57:05,937 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 403 transitions. [2018-04-10 15:57:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-10 15:57:05,938 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:05,938 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:05,938 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:05,938 INFO L82 PathProgramCache]: Analyzing trace with hash -521098867, now seen corresponding path program 1 times [2018-04-10 15:57:05,938 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:05,938 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:05,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:05,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:05,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:05,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:05,956 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:05,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:05,956 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:05,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:05,978 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:06,025 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |c_#length|))) is different from true [2018-04-10 15:57:06,029 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:57:06,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:06,051 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-04-10 15:57:06,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:06,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 33 [2018-04-10 15:57:06,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-10 15:57:06,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:06,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:06,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:06,096 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 15:57:06,097 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:06,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:06,113 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:52 [2018-04-10 15:57:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:06,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:06,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 15:57:06,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 15:57:06,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 15:57:06,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=43, Unknown=2, NotChecked=26, Total=90 [2018-04-10 15:57:06,159 INFO L87 Difference]: Start difference. First operand 365 states and 403 transitions. Second operand 10 states. [2018-04-10 15:57:06,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:06,446 INFO L93 Difference]: Finished difference Result 367 states and 405 transitions. [2018-04-10 15:57:06,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 15:57:06,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-04-10 15:57:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:06,447 INFO L225 Difference]: With dead ends: 367 [2018-04-10 15:57:06,447 INFO L226 Difference]: Without dead ends: 367 [2018-04-10 15:57:06,447 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=133, Unknown=2, NotChecked=50, Total=240 [2018-04-10 15:57:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-04-10 15:57:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2018-04-10 15:57:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-04-10 15:57:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 390 transitions. [2018-04-10 15:57:06,450 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 390 transitions. Word has length 73 [2018-04-10 15:57:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:06,451 INFO L459 AbstractCegarLoop]: Abstraction has 354 states and 390 transitions. [2018-04-10 15:57:06,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 15:57:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 390 transitions. [2018-04-10 15:57:06,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-10 15:57:06,451 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:06,451 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:06,451 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:06,451 INFO L82 PathProgramCache]: Analyzing trace with hash 993999586, now seen corresponding path program 1 times [2018-04-10 15:57:06,451 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:06,451 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:06,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:06,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:06,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:06,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:06,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:06,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:57:06,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:57:06,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:57:06,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:06,477 INFO L87 Difference]: Start difference. First operand 354 states and 390 transitions. Second operand 5 states. [2018-04-10 15:57:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:06,619 INFO L93 Difference]: Finished difference Result 369 states and 407 transitions. [2018-04-10 15:57:06,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:57:06,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-04-10 15:57:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:06,621 INFO L225 Difference]: With dead ends: 369 [2018-04-10 15:57:06,621 INFO L226 Difference]: Without dead ends: 369 [2018-04-10 15:57:06,622 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:57:06,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-04-10 15:57:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 353. [2018-04-10 15:57:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-04-10 15:57:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 389 transitions. [2018-04-10 15:57:06,626 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 389 transitions. Word has length 77 [2018-04-10 15:57:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:06,626 INFO L459 AbstractCegarLoop]: Abstraction has 353 states and 389 transitions. [2018-04-10 15:57:06,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:57:06,627 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 389 transitions. [2018-04-10 15:57:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-10 15:57:06,627 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:06,627 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:06,627 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:06,628 INFO L82 PathProgramCache]: Analyzing trace with hash 993999587, now seen corresponding path program 1 times [2018-04-10 15:57:06,628 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:06,628 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:06,628 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:06,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:06,629 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:06,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:06,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:06,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:57:06,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:57:06,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:57:06,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:06,691 INFO L87 Difference]: Start difference. First operand 353 states and 389 transitions. Second operand 5 states. [2018-04-10 15:57:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:06,867 INFO L93 Difference]: Finished difference Result 380 states and 418 transitions. [2018-04-10 15:57:06,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:57:06,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-04-10 15:57:06,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:06,869 INFO L225 Difference]: With dead ends: 380 [2018-04-10 15:57:06,869 INFO L226 Difference]: Without dead ends: 380 [2018-04-10 15:57:06,869 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:57:06,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-04-10 15:57:06,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 352. [2018-04-10 15:57:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-04-10 15:57:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 388 transitions. [2018-04-10 15:57:06,873 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 388 transitions. Word has length 77 [2018-04-10 15:57:06,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:06,873 INFO L459 AbstractCegarLoop]: Abstraction has 352 states and 388 transitions. [2018-04-10 15:57:06,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:57:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 388 transitions. [2018-04-10 15:57:06,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-10 15:57:06,873 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:06,873 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:06,874 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:06,874 INFO L82 PathProgramCache]: Analyzing trace with hash 749216255, now seen corresponding path program 1 times [2018-04-10 15:57:06,874 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:06,874 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:06,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:06,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:06,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:06,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:06,887 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:06,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:06,887 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:06,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:06,957 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:06,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:06,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:06,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:06,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:06,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:06,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-10 15:57:07,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:57:07,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:07,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:07,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:07,185 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-10 15:57:07,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:78 [2018-04-10 15:57:07,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:57:07,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:07,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:07,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:07,310 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 64 treesize of output 70 [2018-04-10 15:57:07,313 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 65 treesize of output 64 [2018-04-10 15:57:07,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:07,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:07,349 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 70 [2018-04-10 15:57:07,350 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:07,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:07,423 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 2 xjuncts. [2018-04-10 15:57:07,423 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:99, output treesize:213 [2018-04-10 15:57:07,529 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-10 15:57:07,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:07,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:07,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:07,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:07,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:07,543 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 125 [2018-04-10 15:57:07,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:07,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:07,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:07,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:07,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:07,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 37 treesize of output 80 [2018-04-10 15:57:07,560 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:07,565 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:07,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:07,574 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:193, output treesize:81 [2018-04-10 15:57:07,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2018-04-10 15:57:07,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2018-04-10 15:57:07,606 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:07,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:07,621 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 1 xjuncts. [2018-04-10 15:57:07,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:71 [2018-04-10 15:57:07,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 38 [2018-04-10 15:57:07,649 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:07,649 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 27 treesize of output 19 [2018-04-10 15:57:07,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:07,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-10 15:57:07,654 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:07,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:07,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:07,661 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:78, output treesize:15 [2018-04-10 15:57:07,699 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:07,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:07,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-04-10 15:57:07,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 15:57:07,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 15:57:07,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-04-10 15:57:07,700 INFO L87 Difference]: Start difference. First operand 352 states and 388 transitions. Second operand 19 states. [2018-04-10 15:57:09,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:09,037 INFO L93 Difference]: Finished difference Result 434 states and 489 transitions. [2018-04-10 15:57:09,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 15:57:09,037 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-04-10 15:57:09,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:09,038 INFO L225 Difference]: With dead ends: 434 [2018-04-10 15:57:09,038 INFO L226 Difference]: Without dead ends: 434 [2018-04-10 15:57:09,038 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2018-04-10 15:57:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-04-10 15:57:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 384. [2018-04-10 15:57:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-04-10 15:57:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 438 transitions. [2018-04-10 15:57:09,042 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 438 transitions. Word has length 78 [2018-04-10 15:57:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:09,042 INFO L459 AbstractCegarLoop]: Abstraction has 384 states and 438 transitions. [2018-04-10 15:57:09,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 15:57:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 438 transitions. [2018-04-10 15:57:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-10 15:57:09,043 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:09,043 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:09,043 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:09,043 INFO L82 PathProgramCache]: Analyzing trace with hash 749216256, now seen corresponding path program 1 times [2018-04-10 15:57:09,043 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:09,043 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:09,043 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:09,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:09,043 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:09,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:09,058 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:09,058 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:09,058 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:09,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:09,188 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:09,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:09,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 15:57:09,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:09,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-10 15:57:09,242 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 13 treesize of output 3 [2018-04-10 15:57:09,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:15 [2018-04-10 15:57:09,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:57:09,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:09,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:57:09,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:09,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-04-10 15:57:09,380 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 21 treesize of output 33 [2018-04-10 15:57:09,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-04-10 15:57:09,388 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:09,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 17 [2018-04-10 15:57:09,428 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:09,466 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 19 treesize of output 31 [2018-04-10 15:57:09,469 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:09,469 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 17 treesize of output 21 [2018-04-10 15:57:09,469 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 15:57:09,481 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,486 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,499 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 2 xjuncts. [2018-04-10 15:57:09,499 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:50, output treesize:95 [2018-04-10 15:57:09,545 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 15:57:09,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:09,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:09,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2018-04-10 15:57:09,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:55 [2018-04-10 15:57:09,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 50 [2018-04-10 15:57:09,599 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:09,599 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 17 treesize of output 13 [2018-04-10 15:57:09,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-04-10 15:57:09,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:09,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:09,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-10 15:57:09,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-04-10 15:57:09,622 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:09,628 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:09,628 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 11 treesize of output 7 [2018-04-10 15:57:09,629 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,632 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:09,637 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:87, output treesize:9 [2018-04-10 15:57:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:09,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:09,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-10 15:57:09,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 15:57:09,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 15:57:09,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-04-10 15:57:09,658 INFO L87 Difference]: Start difference. First operand 384 states and 438 transitions. Second operand 18 states. [2018-04-10 15:57:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:10,342 INFO L93 Difference]: Finished difference Result 449 states and 513 transitions. [2018-04-10 15:57:10,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 15:57:10,343 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-04-10 15:57:10,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:10,344 INFO L225 Difference]: With dead ends: 449 [2018-04-10 15:57:10,344 INFO L226 Difference]: Without dead ends: 449 [2018-04-10 15:57:10,344 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2018-04-10 15:57:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-04-10 15:57:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 391. [2018-04-10 15:57:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-04-10 15:57:10,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 447 transitions. [2018-04-10 15:57:10,350 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 447 transitions. Word has length 78 [2018-04-10 15:57:10,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:10,350 INFO L459 AbstractCegarLoop]: Abstraction has 391 states and 447 transitions. [2018-04-10 15:57:10,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 15:57:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 447 transitions. [2018-04-10 15:57:10,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-10 15:57:10,351 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:10,351 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:10,351 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:10,352 INFO L82 PathProgramCache]: Analyzing trace with hash -900826515, now seen corresponding path program 1 times [2018-04-10 15:57:10,352 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:10,352 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:10,352 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:10,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:10,353 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:10,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:10,370 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:10,370 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:10,370 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:10,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:10,393 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:10,413 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)))) is different from true [2018-04-10 15:57:10,416 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)) (= |c_#valid| (store (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)))) is different from true [2018-04-10 15:57:10,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:10,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:10,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 15:57:10,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-04-10 15:57:10,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:10,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:10,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:10,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-04-10 15:57:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-04-10 15:57:10,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:10,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 15:57:10,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:57:10,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:57:10,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2018-04-10 15:57:10,546 INFO L87 Difference]: Start difference. First operand 391 states and 447 transitions. Second operand 7 states. [2018-04-10 15:57:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:10,689 INFO L93 Difference]: Finished difference Result 397 states and 449 transitions. [2018-04-10 15:57:10,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:57:10,690 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-04-10 15:57:10,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:10,691 INFO L225 Difference]: With dead ends: 397 [2018-04-10 15:57:10,691 INFO L226 Difference]: Without dead ends: 397 [2018-04-10 15:57:10,692 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2018-04-10 15:57:10,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-04-10 15:57:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 391. [2018-04-10 15:57:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-04-10 15:57:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 446 transitions. [2018-04-10 15:57:10,697 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 446 transitions. Word has length 81 [2018-04-10 15:57:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:10,697 INFO L459 AbstractCegarLoop]: Abstraction has 391 states and 446 transitions. [2018-04-10 15:57:10,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:57:10,697 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 446 transitions. [2018-04-10 15:57:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-10 15:57:10,698 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:10,698 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:10,698 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:10,698 INFO L82 PathProgramCache]: Analyzing trace with hash -900826514, now seen corresponding path program 1 times [2018-04-10 15:57:10,698 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:10,699 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:10,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:10,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:10,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:10,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:10,715 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:10,715 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:10,715 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:10,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:10,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:10,754 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |c_#length|))) is different from true [2018-04-10 15:57:10,771 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:57:10,773 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:57:10,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:10,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-04-10 15:57:10,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:10,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 33 [2018-04-10 15:57:10,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-10 15:57:10,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:10,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:10,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:10,833 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 15:57:10,834 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:10,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:10,844 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:46 [2018-04-10 15:57:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-04-10 15:57:10,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:10,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 15:57:10,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 15:57:10,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 15:57:10,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=32, Unknown=3, NotChecked=36, Total=90 [2018-04-10 15:57:10,870 INFO L87 Difference]: Start difference. First operand 391 states and 446 transitions. Second operand 10 states. [2018-04-10 15:57:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:11,026 INFO L93 Difference]: Finished difference Result 405 states and 458 transitions. [2018-04-10 15:57:11,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:57:11,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2018-04-10 15:57:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:11,028 INFO L225 Difference]: With dead ends: 405 [2018-04-10 15:57:11,028 INFO L226 Difference]: Without dead ends: 405 [2018-04-10 15:57:11,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=65, Unknown=3, NotChecked=54, Total=156 [2018-04-10 15:57:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-04-10 15:57:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 383. [2018-04-10 15:57:11,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-04-10 15:57:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 436 transitions. [2018-04-10 15:57:11,032 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 436 transitions. Word has length 81 [2018-04-10 15:57:11,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:11,032 INFO L459 AbstractCegarLoop]: Abstraction has 383 states and 436 transitions. [2018-04-10 15:57:11,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 15:57:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 436 transitions. [2018-04-10 15:57:11,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-10 15:57:11,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:11,033 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:11,033 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:11,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1061685466, now seen corresponding path program 1 times [2018-04-10 15:57:11,034 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:11,034 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:11,034 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:11,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:11,034 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:11,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:11,052 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:11,053 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:11,053 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:11,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:11,082 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:11,097 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0))) is different from true [2018-04-10 15:57:11,101 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (let ((.cse0 (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1))) (and (= |c_#valid| (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= 0 (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|))))) is different from true [2018-04-10 15:57:11,117 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (let ((.cse0 (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1))) (and (= |c_#valid| (store (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= 0 (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|))))) is different from true [2018-04-10 15:57:11,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:11,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:11,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:11,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:11,135 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2018-04-10 15:57:11,137 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-04-10 15:57:11,140 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 28 treesize of output 33 [2018-04-10 15:57:11,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:11,146 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:11,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:11,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:11,159 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:31, output treesize:33 [2018-04-10 15:57:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 3 not checked. [2018-04-10 15:57:11,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:11,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-10 15:57:11,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:57:11,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:57:11,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2018-04-10 15:57:11,190 INFO L87 Difference]: Start difference. First operand 383 states and 436 transitions. Second operand 8 states. [2018-04-10 15:57:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:11,325 INFO L93 Difference]: Finished difference Result 440 states and 499 transitions. [2018-04-10 15:57:11,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:57:11,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-04-10 15:57:11,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:11,326 INFO L225 Difference]: With dead ends: 440 [2018-04-10 15:57:11,326 INFO L226 Difference]: Without dead ends: 440 [2018-04-10 15:57:11,326 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2018-04-10 15:57:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-04-10 15:57:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 407. [2018-04-10 15:57:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-04-10 15:57:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 463 transitions. [2018-04-10 15:57:11,330 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 463 transitions. Word has length 82 [2018-04-10 15:57:11,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:11,330 INFO L459 AbstractCegarLoop]: Abstraction has 407 states and 463 transitions. [2018-04-10 15:57:11,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:57:11,330 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 463 transitions. [2018-04-10 15:57:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-10 15:57:11,330 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:11,330 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:11,330 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:11,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1061685467, now seen corresponding path program 1 times [2018-04-10 15:57:11,331 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:11,331 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:11,331 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:11,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:11,331 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:11,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:11,343 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:11,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:11,343 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:11,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:11,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:11,401 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:57:11,425 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 16)))) is different from true [2018-04-10 15:57:11,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:11,453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-04-10 15:57:11,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:11,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:11,458 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-04-10 15:57:11,476 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 46 [2018-04-10 15:57:11,477 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-10 15:57:11,511 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:11,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:11,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:11,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:11,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:11,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:11,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-04-10 15:57:11,559 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:11,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:11,581 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:72 [2018-04-10 15:57:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 3 not checked. [2018-04-10 15:57:11,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:11,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-10 15:57:11,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 15:57:11,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 15:57:11,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=42, Unknown=3, NotChecked=26, Total=90 [2018-04-10 15:57:11,662 INFO L87 Difference]: Start difference. First operand 407 states and 463 transitions. Second operand 10 states. [2018-04-10 15:57:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:11,911 INFO L93 Difference]: Finished difference Result 439 states and 498 transitions. [2018-04-10 15:57:11,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:57:11,912 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2018-04-10 15:57:11,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:11,913 INFO L225 Difference]: With dead ends: 439 [2018-04-10 15:57:11,913 INFO L226 Difference]: Without dead ends: 439 [2018-04-10 15:57:11,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=93, Unknown=3, NotChecked=42, Total=182 [2018-04-10 15:57:11,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-04-10 15:57:11,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 407. [2018-04-10 15:57:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-04-10 15:57:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 462 transitions. [2018-04-10 15:57:11,916 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 462 transitions. Word has length 82 [2018-04-10 15:57:11,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:11,916 INFO L459 AbstractCegarLoop]: Abstraction has 407 states and 462 transitions. [2018-04-10 15:57:11,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 15:57:11,917 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 462 transitions. [2018-04-10 15:57:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-10 15:57:11,917 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:11,917 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:11,917 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:11,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1062572927, now seen corresponding path program 1 times [2018-04-10 15:57:11,917 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:11,917 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:11,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:11,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:11,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:11,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:11,927 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:11,927 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:11,927 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:11,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:12,015 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:12,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:12,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:12,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 15:57:12,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:12,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:12,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-10 15:57:12,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:12,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:12,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:12,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-04-10 15:57:12,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:12,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:12,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:28 [2018-04-10 15:57:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:12,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:12,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-10 15:57:12,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:57:12,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:57:12,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:57:12,112 INFO L87 Difference]: Start difference. First operand 407 states and 462 transitions. Second operand 7 states. [2018-04-10 15:57:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:12,560 INFO L93 Difference]: Finished difference Result 426 states and 482 transitions. [2018-04-10 15:57:12,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:57:12,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-04-10 15:57:12,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:12,561 INFO L225 Difference]: With dead ends: 426 [2018-04-10 15:57:12,561 INFO L226 Difference]: Without dead ends: 426 [2018-04-10 15:57:12,562 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-04-10 15:57:12,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-04-10 15:57:12,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 406. [2018-04-10 15:57:12,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-04-10 15:57:12,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 460 transitions. [2018-04-10 15:57:12,566 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 460 transitions. Word has length 82 [2018-04-10 15:57:12,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:12,566 INFO L459 AbstractCegarLoop]: Abstraction has 406 states and 460 transitions. [2018-04-10 15:57:12,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:57:12,566 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 460 transitions. [2018-04-10 15:57:12,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-10 15:57:12,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:12,567 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:12,567 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:12,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1062572928, now seen corresponding path program 1 times [2018-04-10 15:57:12,567 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:12,567 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:12,567 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:12,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:12,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:12,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:12,583 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:12,583 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:12,583 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:12,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:12,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:12,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:12,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:12,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:12,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:57:12,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 15:57:12,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:12,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:12,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-04-10 15:57:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:12,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:12,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-10 15:57:12,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:57:12,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:57:12,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:57:12,690 INFO L87 Difference]: Start difference. First operand 406 states and 460 transitions. Second operand 6 states. [2018-04-10 15:57:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:12,860 INFO L93 Difference]: Finished difference Result 408 states and 458 transitions. [2018-04-10 15:57:12,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:57:12,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-04-10 15:57:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:12,862 INFO L225 Difference]: With dead ends: 408 [2018-04-10 15:57:12,862 INFO L226 Difference]: Without dead ends: 408 [2018-04-10 15:57:12,862 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-10 15:57:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-04-10 15:57:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 384. [2018-04-10 15:57:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-04-10 15:57:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 434 transitions. [2018-04-10 15:57:12,867 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 434 transitions. Word has length 82 [2018-04-10 15:57:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:12,868 INFO L459 AbstractCegarLoop]: Abstraction has 384 states and 434 transitions. [2018-04-10 15:57:12,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:57:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 434 transitions. [2018-04-10 15:57:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-10 15:57:12,868 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:12,868 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:12,869 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:12,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1889120956, now seen corresponding path program 1 times [2018-04-10 15:57:12,869 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:12,869 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:12,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:12,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:12,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:12,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:12,889 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:12,889 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:12,889 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:12,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:12,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:12,928 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)))) is different from true [2018-04-10 15:57:12,931 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)) (= |c_#valid| (store (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)))) is different from true [2018-04-10 15:57:12,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:12,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:12,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 15:57:12,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-04-10 15:57:12,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:12,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:12,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:12,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-04-10 15:57:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-04-10 15:57:13,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:13,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 15:57:13,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:57:13,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:57:13,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2018-04-10 15:57:13,005 INFO L87 Difference]: Start difference. First operand 384 states and 434 transitions. Second operand 7 states. [2018-04-10 15:57:13,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:13,100 INFO L93 Difference]: Finished difference Result 385 states and 433 transitions. [2018-04-10 15:57:13,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:57:13,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-04-10 15:57:13,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:13,102 INFO L225 Difference]: With dead ends: 385 [2018-04-10 15:57:13,102 INFO L226 Difference]: Without dead ends: 385 [2018-04-10 15:57:13,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2018-04-10 15:57:13,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-04-10 15:57:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 384. [2018-04-10 15:57:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-04-10 15:57:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 433 transitions. [2018-04-10 15:57:13,107 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 433 transitions. Word has length 83 [2018-04-10 15:57:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:13,108 INFO L459 AbstractCegarLoop]: Abstraction has 384 states and 433 transitions. [2018-04-10 15:57:13,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:57:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 433 transitions. [2018-04-10 15:57:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-10 15:57:13,108 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:13,109 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:13,109 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:13,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1889120957, now seen corresponding path program 1 times [2018-04-10 15:57:13,109 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:13,109 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:13,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:13,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:13,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:13,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:13,127 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:13,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:13,127 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:13,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:13,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:13,171 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |c_#length|))) is different from true [2018-04-10 15:57:13,173 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:57:13,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:13,201 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-04-10 15:57:13,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:13,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 33 [2018-04-10 15:57:13,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-10 15:57:13,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:13,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:13,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:13,260 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 15:57:13,260 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:13,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:13,276 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:52 [2018-04-10 15:57:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-04-10 15:57:13,328 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:13,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 15:57:13,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 15:57:13,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 15:57:13,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=43, Unknown=2, NotChecked=26, Total=90 [2018-04-10 15:57:13,329 INFO L87 Difference]: Start difference. First operand 384 states and 433 transitions. Second operand 10 states. [2018-04-10 15:57:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:13,588 INFO L93 Difference]: Finished difference Result 388 states and 432 transitions. [2018-04-10 15:57:13,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 15:57:13,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2018-04-10 15:57:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:13,590 INFO L225 Difference]: With dead ends: 388 [2018-04-10 15:57:13,590 INFO L226 Difference]: Without dead ends: 388 [2018-04-10 15:57:13,590 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=117, Unknown=2, NotChecked=46, Total=210 [2018-04-10 15:57:13,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-04-10 15:57:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 370. [2018-04-10 15:57:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-04-10 15:57:13,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 416 transitions. [2018-04-10 15:57:13,595 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 416 transitions. Word has length 83 [2018-04-10 15:57:13,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:13,595 INFO L459 AbstractCegarLoop]: Abstraction has 370 states and 416 transitions. [2018-04-10 15:57:13,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 15:57:13,595 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 416 transitions. [2018-04-10 15:57:13,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-10 15:57:13,596 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:13,596 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:13,596 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:13,596 INFO L82 PathProgramCache]: Analyzing trace with hash -33833550, now seen corresponding path program 1 times [2018-04-10 15:57:13,596 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:13,596 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:13,597 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:13,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:13,597 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:13,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:13,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:13,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:57:13,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 15:57:13,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 15:57:13,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:57:13,638 INFO L87 Difference]: Start difference. First operand 370 states and 416 transitions. Second operand 3 states. [2018-04-10 15:57:13,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:13,643 INFO L93 Difference]: Finished difference Result 372 states and 418 transitions. [2018-04-10 15:57:13,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 15:57:13,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-04-10 15:57:13,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:13,645 INFO L225 Difference]: With dead ends: 372 [2018-04-10 15:57:13,645 INFO L226 Difference]: Without dead ends: 372 [2018-04-10 15:57:13,645 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:57:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-04-10 15:57:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2018-04-10 15:57:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-04-10 15:57:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 418 transitions. [2018-04-10 15:57:13,650 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 418 transitions. Word has length 84 [2018-04-10 15:57:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:13,650 INFO L459 AbstractCegarLoop]: Abstraction has 372 states and 418 transitions. [2018-04-10 15:57:13,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 15:57:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 418 transitions. [2018-04-10 15:57:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-10 15:57:13,651 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:13,651 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:13,651 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:13,651 INFO L82 PathProgramCache]: Analyzing trace with hash -452060643, now seen corresponding path program 1 times [2018-04-10 15:57:13,651 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:13,652 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:13,652 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:13,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:13,652 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:13,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:13,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:13,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 15:57:13,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:57:13,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:57:13,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:13,689 INFO L87 Difference]: Start difference. First operand 372 states and 418 transitions. Second operand 5 states. [2018-04-10 15:57:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:13,712 INFO L93 Difference]: Finished difference Result 450 states and 517 transitions. [2018-04-10 15:57:13,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:57:13,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-04-10 15:57:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:13,714 INFO L225 Difference]: With dead ends: 450 [2018-04-10 15:57:13,714 INFO L226 Difference]: Without dead ends: 450 [2018-04-10 15:57:13,714 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:57:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-04-10 15:57:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 378. [2018-04-10 15:57:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-04-10 15:57:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 424 transitions. [2018-04-10 15:57:13,720 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 424 transitions. Word has length 85 [2018-04-10 15:57:13,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:13,720 INFO L459 AbstractCegarLoop]: Abstraction has 378 states and 424 transitions. [2018-04-10 15:57:13,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:57:13,720 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 424 transitions. [2018-04-10 15:57:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-10 15:57:13,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:13,721 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:13,721 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:13,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1741173812, now seen corresponding path program 1 times [2018-04-10 15:57:13,721 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:13,722 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:13,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:13,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:13,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:13,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:13,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:13,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:57:13,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:57:13,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:57:13,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:13,761 INFO L87 Difference]: Start difference. First operand 378 states and 424 transitions. Second operand 5 states. [2018-04-10 15:57:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:13,878 INFO L93 Difference]: Finished difference Result 392 states and 440 transitions. [2018-04-10 15:57:13,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:57:13,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2018-04-10 15:57:13,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:13,879 INFO L225 Difference]: With dead ends: 392 [2018-04-10 15:57:13,879 INFO L226 Difference]: Without dead ends: 392 [2018-04-10 15:57:13,880 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:57:13,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-04-10 15:57:13,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 383. [2018-04-10 15:57:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-04-10 15:57:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 431 transitions. [2018-04-10 15:57:13,884 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 431 transitions. Word has length 84 [2018-04-10 15:57:13,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:13,884 INFO L459 AbstractCegarLoop]: Abstraction has 383 states and 431 transitions. [2018-04-10 15:57:13,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:57:13,884 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 431 transitions. [2018-04-10 15:57:13,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-10 15:57:13,885 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:13,885 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:13,885 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:13,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1741173813, now seen corresponding path program 1 times [2018-04-10 15:57:13,886 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:13,886 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:13,886 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:13,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:13,886 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:13,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:13,904 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:13,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:13,905 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:13,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:13,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:14,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:14,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:14,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:14,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 15:57:14,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:14,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:14,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:14,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-10 15:57:14,040 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 13 treesize of output 3 [2018-04-10 15:57:14,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:14,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:14,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:15 [2018-04-10 15:57:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:57:14,098 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-10 15:57:14,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:14,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:14,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:14,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-04-10 15:57:14,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 32 [2018-04-10 15:57:14,153 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26 [2018-04-10 15:57:14,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 15:57:14,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-04-10 15:57:14,174 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:14,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:14,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:57:14,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:14,206 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:14,207 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:14,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:14,223 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:42, output treesize:67 [2018-04-10 15:57:14,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:14,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:14,255 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 45 treesize of output 46 [2018-04-10 15:57:14,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:14,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:14,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2018-04-10 15:57:14,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-04-10 15:57:14,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-04-10 15:57:14,293 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:14,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:14,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:14,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:37 [2018-04-10 15:57:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:14,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:14,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-04-10 15:57:14,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 15:57:14,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 15:57:14,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-04-10 15:57:14,421 INFO L87 Difference]: Start difference. First operand 383 states and 431 transitions. Second operand 18 states. [2018-04-10 15:57:15,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:15,138 INFO L93 Difference]: Finished difference Result 451 states and 509 transitions. [2018-04-10 15:57:15,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 15:57:15,139 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 84 [2018-04-10 15:57:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:15,140 INFO L225 Difference]: With dead ends: 451 [2018-04-10 15:57:15,140 INFO L226 Difference]: Without dead ends: 451 [2018-04-10 15:57:15,140 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-04-10 15:57:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-04-10 15:57:15,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 383. [2018-04-10 15:57:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-04-10 15:57:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 429 transitions. [2018-04-10 15:57:15,143 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 429 transitions. Word has length 84 [2018-04-10 15:57:15,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:15,143 INFO L459 AbstractCegarLoop]: Abstraction has 383 states and 429 transitions. [2018-04-10 15:57:15,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 15:57:15,143 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 429 transitions. [2018-04-10 15:57:15,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-10 15:57:15,143 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:15,143 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:15,144 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:15,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1922475543, now seen corresponding path program 1 times [2018-04-10 15:57:15,144 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:15,144 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:15,144 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:15,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:15,144 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:15,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:15,155 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:15,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:15,155 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:15,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:15,178 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:15,194 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)))) is different from true [2018-04-10 15:57:15,197 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)) (= |c_#valid| (store (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)))) is different from true [2018-04-10 15:57:15,216 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store (store (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 1)) (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)))) is different from true [2018-04-10 15:57:15,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:15,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:15,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-04-10 15:57:15,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2018-04-10 15:57:15,240 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 22 treesize of output 25 [2018-04-10 15:57:15,240 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:15,246 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:15,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:15,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:15,269 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:23, output treesize:25 [2018-04-10 15:57:15,300 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 3 not checked. [2018-04-10 15:57:15,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:15,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-10 15:57:15,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:57:15,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:57:15,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2018-04-10 15:57:15,301 INFO L87 Difference]: Start difference. First operand 383 states and 429 transitions. Second operand 8 states. [2018-04-10 15:57:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:15,400 INFO L93 Difference]: Finished difference Result 414 states and 464 transitions. [2018-04-10 15:57:15,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:57:15,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-04-10 15:57:15,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:15,401 INFO L225 Difference]: With dead ends: 414 [2018-04-10 15:57:15,401 INFO L226 Difference]: Without dead ends: 414 [2018-04-10 15:57:15,401 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2018-04-10 15:57:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-04-10 15:57:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 385. [2018-04-10 15:57:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-10 15:57:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 432 transitions. [2018-04-10 15:57:15,404 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 432 transitions. Word has length 84 [2018-04-10 15:57:15,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:15,404 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 432 transitions. [2018-04-10 15:57:15,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:57:15,404 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 432 transitions. [2018-04-10 15:57:15,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-10 15:57:15,405 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:15,405 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:15,405 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:15,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1922475542, now seen corresponding path program 1 times [2018-04-10 15:57:15,405 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:15,405 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:15,405 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:15,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:15,405 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:15,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:15,420 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:15,421 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:15,421 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:15,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:15,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:15,474 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |c_#length|))) is different from true [2018-04-10 15:57:15,514 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:57:15,535 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80) |c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 16)))) is different from true [2018-04-10 15:57:15,538 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 16)))) is different from true [2018-04-10 15:57:15,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:15,552 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-04-10 15:57:15,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:15,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 39 [2018-04-10 15:57:15,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:15,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 40 [2018-04-10 15:57:15,588 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-10 15:57:15,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:15,671 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 20 treesize of output 27 [2018-04-10 15:57:15,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 15:57:15,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:15,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:15,718 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 50 [2018-04-10 15:57:15,719 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-04-10 15:57:15,756 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:57:15,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:57:15,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:15,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:15,795 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 15:57:15,795 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:15,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-10 15:57:15,812 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:36, output treesize:90 [2018-04-10 15:57:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 3 not checked. [2018-04-10 15:57:15,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:15,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-10 15:57:15,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 15:57:15,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 15:57:15,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-10 15:57:15,889 INFO L87 Difference]: Start difference. First operand 385 states and 432 transitions. Second operand 12 states. [2018-04-10 15:57:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:16,118 INFO L93 Difference]: Finished difference Result 413 states and 463 transitions. [2018-04-10 15:57:16,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 15:57:16,118 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 84 [2018-04-10 15:57:16,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:16,119 INFO L225 Difference]: With dead ends: 413 [2018-04-10 15:57:16,119 INFO L226 Difference]: Without dead ends: 413 [2018-04-10 15:57:16,119 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=135, Unknown=4, NotChecked=108, Total=306 [2018-04-10 15:57:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-10 15:57:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 385. [2018-04-10 15:57:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-10 15:57:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 431 transitions. [2018-04-10 15:57:16,123 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 431 transitions. Word has length 84 [2018-04-10 15:57:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:16,123 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 431 transitions. [2018-04-10 15:57:16,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 15:57:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 431 transitions. [2018-04-10 15:57:16,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-04-10 15:57:16,124 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:16,124 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:16,124 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:16,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1562213312, now seen corresponding path program 1 times [2018-04-10 15:57:16,124 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:16,124 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:16,125 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:16,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:16,125 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:16,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:16,140 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:16,140 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:16,141 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:16,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:16,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:16,182 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0))) is different from true [2018-04-10 15:57:16,185 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (let ((.cse0 (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1))) (and (= |c_#valid| (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= 0 (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|))))) is different from true [2018-04-10 15:57:16,211 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (let ((.cse0 (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1))) (and (= |c_#valid| (store (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= 0 (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|))))) is different from true [2018-04-10 15:57:16,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:16,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:16,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:16,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:16,246 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2018-04-10 15:57:16,249 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-04-10 15:57:16,254 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 28 treesize of output 33 [2018-04-10 15:57:16,254 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:16,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:16,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:16,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:16,279 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:31, output treesize:33 [2018-04-10 15:57:16,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 3 not checked. [2018-04-10 15:57:16,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:16,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-10 15:57:16,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:57:16,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:57:16,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2018-04-10 15:57:16,312 INFO L87 Difference]: Start difference. First operand 385 states and 431 transitions. Second operand 8 states. [2018-04-10 15:57:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:16,388 INFO L93 Difference]: Finished difference Result 437 states and 489 transitions. [2018-04-10 15:57:16,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:57:16,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2018-04-10 15:57:16,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:16,389 INFO L225 Difference]: With dead ends: 437 [2018-04-10 15:57:16,389 INFO L226 Difference]: Without dead ends: 437 [2018-04-10 15:57:16,390 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2018-04-10 15:57:16,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-04-10 15:57:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 412. [2018-04-10 15:57:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-04-10 15:57:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 462 transitions. [2018-04-10 15:57:16,393 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 462 transitions. Word has length 86 [2018-04-10 15:57:16,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:16,393 INFO L459 AbstractCegarLoop]: Abstraction has 412 states and 462 transitions. [2018-04-10 15:57:16,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:57:16,393 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 462 transitions. [2018-04-10 15:57:16,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-04-10 15:57:16,393 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:16,393 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:16,393 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:16,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1562213313, now seen corresponding path program 1 times [2018-04-10 15:57:16,394 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:16,394 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:16,394 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:16,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:16,394 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:16,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:16,410 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:16,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:16,410 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:16,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:16,431 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:16,472 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:57:16,497 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 16)))) is different from true [2018-04-10 15:57:16,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:16,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:16,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:16,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:16,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-04-10 15:57:16,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:16,537 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-04-10 15:57:16,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:16,543 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-04-10 15:57:16,559 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 46 [2018-04-10 15:57:16,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-04-10 15:57:16,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:16,606 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:16,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:16,627 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:72 [2018-04-10 15:57:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 3 not checked. [2018-04-10 15:57:16,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:16,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-10 15:57:16,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 15:57:16,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 15:57:16,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=42, Unknown=3, NotChecked=26, Total=90 [2018-04-10 15:57:16,680 INFO L87 Difference]: Start difference. First operand 412 states and 462 transitions. Second operand 10 states. [2018-04-10 15:57:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:16,916 INFO L93 Difference]: Finished difference Result 436 states and 488 transitions. [2018-04-10 15:57:16,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:57:16,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2018-04-10 15:57:16,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:16,917 INFO L225 Difference]: With dead ends: 436 [2018-04-10 15:57:16,918 INFO L226 Difference]: Without dead ends: 436 [2018-04-10 15:57:16,918 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=93, Unknown=3, NotChecked=42, Total=182 [2018-04-10 15:57:16,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-04-10 15:57:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 412. [2018-04-10 15:57:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-04-10 15:57:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 461 transitions. [2018-04-10 15:57:16,921 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 461 transitions. Word has length 86 [2018-04-10 15:57:16,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:16,921 INFO L459 AbstractCegarLoop]: Abstraction has 412 states and 461 transitions. [2018-04-10 15:57:16,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 15:57:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 461 transitions. [2018-04-10 15:57:16,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-10 15:57:16,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:16,922 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:16,922 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:16,922 INFO L82 PathProgramCache]: Analyzing trace with hash 811203799, now seen corresponding path program 1 times [2018-04-10 15:57:16,922 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:16,922 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:16,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:16,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:16,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:16,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:16,934 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:16,934 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:16,934 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:16,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:16,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:16,995 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 11 treesize of output 1 [2018-04-10 15:57:16,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:16,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:16,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2018-04-10 15:57:17,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:17,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:17,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 15:57:17,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:17,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 15:57:17,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:17,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:17,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-04-10 15:57:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:17,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:17,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 15:57:17,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:57:17,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:57:17,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:57:17,080 INFO L87 Difference]: Start difference. First operand 412 states and 461 transitions. Second operand 11 states. [2018-04-10 15:57:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:17,281 INFO L93 Difference]: Finished difference Result 410 states and 456 transitions. [2018-04-10 15:57:17,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 15:57:17,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2018-04-10 15:57:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:17,282 INFO L225 Difference]: With dead ends: 410 [2018-04-10 15:57:17,282 INFO L226 Difference]: Without dead ends: 410 [2018-04-10 15:57:17,282 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-04-10 15:57:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-04-10 15:57:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2018-04-10 15:57:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-04-10 15:57:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 454 transitions. [2018-04-10 15:57:17,285 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 454 transitions. Word has length 89 [2018-04-10 15:57:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:17,285 INFO L459 AbstractCegarLoop]: Abstraction has 408 states and 454 transitions. [2018-04-10 15:57:17,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:57:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 454 transitions. [2018-04-10 15:57:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-10 15:57:17,286 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:17,286 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:17,286 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:17,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1920471611, now seen corresponding path program 1 times [2018-04-10 15:57:17,286 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:17,286 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:17,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:17,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:17,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:17,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:17,316 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:17,316 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:17,316 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:17,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:17,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:17,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:17,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:17,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:17,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:57:17,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:57:17,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:17,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:17,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:17,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:57:17,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:17,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:17,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:17,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:17,419 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-04-10 15:57:17,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:17,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:17,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:17,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-04-10 15:57:17,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:17,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:17,770 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-04-10 15:57:17,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:17,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:17,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:17,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:17,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-10 15:57:17,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:17,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:17,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:17,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:124, output treesize:125 [2018-04-10 15:57:18,496 WARN L151 SmtUtils]: Spent 391ms on a formula simplification. DAG size of input: 83 DAG size of output 81 [2018-04-10 15:57:18,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:18,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:18,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:18,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:18,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:18,541 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2018-04-10 15:57:18,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:18,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:18,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:18,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:18,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:18,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:18,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 39 [2018-04-10 15:57:18,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:18,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:18,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 159 treesize of output 107 [2018-04-10 15:57:18,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:18,789 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:18,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:18,876 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 72 treesize of output 69 [2018-04-10 15:57:18,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-10 15:57:18,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:18,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-10 15:57:18,888 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:18,899 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:18,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:18,972 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 60 treesize of output 62 [2018-04-10 15:57:18,978 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 14 treesize of output 15 [2018-04-10 15:57:18,978 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:19,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:19,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:19,115 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 108 [2018-04-10 15:57:19,115 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 15:57:19,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:19,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:19,153 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 76 treesize of output 102 [2018-04-10 15:57:19,154 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-04-10 15:57:19,961 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 48 treesize of output 47 [2018-04-10 15:57:19,961 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:20,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:20,279 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:20,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:20,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 54 [2018-04-10 15:57:20,284 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:20,508 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:20,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-04-10 15:57:20,544 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:21,229 INFO L267 ElimStorePlain]: Start of recursive call 11: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 15:57:21,371 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-10 15:57:21,500 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-10 15:57:21,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-10 15:57:21,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 159 treesize of output 107 [2018-04-10 15:57:21,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:21,834 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:21,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:21,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 69 [2018-04-10 15:57:21,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-10 15:57:21,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:21,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-10 15:57:21,878 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:21,883 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:21,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:21,902 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 60 treesize of output 62 [2018-04-10 15:57:21,906 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-10 15:57:21,906 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:21,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:21,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 101 [2018-04-10 15:57:21,956 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 15:57:21,975 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 15:57:21,975 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:22,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-04-10 15:57:22,292 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:22,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:22,359 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:22,361 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 47 treesize of output 50 [2018-04-10 15:57:22,361 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:22,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:22,421 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 2 case distinctions, treesize of input 47 treesize of output 64 [2018-04-10 15:57:22,422 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-04-10 15:57:22,539 INFO L267 ElimStorePlain]: Start of recursive call 23: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:57:22,566 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:57:22,593 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:57:22,621 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:57:22,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 26 dim-0 vars, and 10 xjuncts. [2018-04-10 15:57:22,713 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 13 variables, input treesize:370, output treesize:1177 [2018-04-10 15:57:25,026 WARN L151 SmtUtils]: Spent 2149ms on a formula simplification. DAG size of input: 359 DAG size of output 192 [2018-04-10 15:57:25,275 WARN L148 SmtUtils]: Spent 143ms on a formula simplification that was a NOOP. DAG size: 194 [2018-04-10 15:57:25,714 WARN L148 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 196 [2018-04-10 15:57:25,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:25,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:25,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 95 [2018-04-10 15:57:25,813 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:25,818 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2018-04-10 15:57:25,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:25,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:25,842 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 25 treesize of output 18 [2018-04-10 15:57:25,843 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:25,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-10 15:57:25,855 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:25,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:25,878 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 24 treesize of output 22 [2018-04-10 15:57:25,879 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:25,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 15:57:25,880 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:25,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 15:57:25,883 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:25,885 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:25,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:25,894 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:152, output treesize:23 [2018-04-10 15:57:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:26,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:26,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-04-10 15:57:26,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 15:57:26,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 15:57:26,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=537, Unknown=9, NotChecked=0, Total=600 [2018-04-10 15:57:26,029 INFO L87 Difference]: Start difference. First operand 408 states and 454 transitions. Second operand 25 states. [2018-04-10 15:57:27,642 WARN L151 SmtUtils]: Spent 359ms on a formula simplification. DAG size of input: 199 DAG size of output 199 [2018-04-10 15:57:27,989 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 197 DAG size of output 196 [2018-04-10 15:57:28,385 WARN L151 SmtUtils]: Spent 294ms on a formula simplification. DAG size of input: 201 DAG size of output 201 [2018-04-10 15:57:28,602 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 197 DAG size of output 164 [2018-04-10 15:57:30,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:30,137 INFO L93 Difference]: Finished difference Result 465 states and 521 transitions. [2018-04-10 15:57:30,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 15:57:30,138 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-04-10 15:57:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:30,139 INFO L225 Difference]: With dead ends: 465 [2018-04-10 15:57:30,139 INFO L226 Difference]: Without dead ends: 465 [2018-04-10 15:57:30,140 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=113, Invalid=1135, Unknown=12, NotChecked=0, Total=1260 [2018-04-10 15:57:30,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-04-10 15:57:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 425. [2018-04-10 15:57:30,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-04-10 15:57:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 474 transitions. [2018-04-10 15:57:30,143 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 474 transitions. Word has length 88 [2018-04-10 15:57:30,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:30,143 INFO L459 AbstractCegarLoop]: Abstraction has 425 states and 474 transitions. [2018-04-10 15:57:30,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 15:57:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 474 transitions. [2018-04-10 15:57:30,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-10 15:57:30,144 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:30,144 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:30,144 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:30,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1951552689, now seen corresponding path program 1 times [2018-04-10 15:57:30,144 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:30,144 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:30,145 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:30,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:30,145 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:30,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:30,164 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:30,165 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:30,165 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:30,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:30,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:30,212 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)))) is different from true [2018-04-10 15:57:30,216 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (let ((.cse0 (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1))) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)) (= |c_#valid| (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)) (= 0 (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|))))) is different from true [2018-04-10 15:57:30,240 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (let ((.cse0 (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1))) (and (= |c_#valid| (store (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 1)) (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)) (= 0 (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|))))) is different from true [2018-04-10 15:57:30,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:30,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:30,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:30,265 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 45 [2018-04-10 15:57:30,268 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-04-10 15:57:30,275 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 28 treesize of output 33 [2018-04-10 15:57:30,275 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:30,283 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:30,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:30,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:30,294 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:31, output treesize:33 [2018-04-10 15:57:30,320 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 3 not checked. [2018-04-10 15:57:30,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:30,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-10 15:57:30,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:57:30,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:57:30,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2018-04-10 15:57:30,321 INFO L87 Difference]: Start difference. First operand 425 states and 474 transitions. Second operand 8 states. [2018-04-10 15:57:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:30,453 INFO L93 Difference]: Finished difference Result 448 states and 500 transitions. [2018-04-10 15:57:30,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:57:30,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-04-10 15:57:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:30,456 INFO L225 Difference]: With dead ends: 448 [2018-04-10 15:57:30,456 INFO L226 Difference]: Without dead ends: 448 [2018-04-10 15:57:30,456 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2018-04-10 15:57:30,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-04-10 15:57:30,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 427. [2018-04-10 15:57:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-04-10 15:57:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 477 transitions. [2018-04-10 15:57:30,462 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 477 transitions. Word has length 88 [2018-04-10 15:57:30,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:30,462 INFO L459 AbstractCegarLoop]: Abstraction has 427 states and 477 transitions. [2018-04-10 15:57:30,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:57:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 477 transitions. [2018-04-10 15:57:30,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-10 15:57:30,463 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:30,463 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:30,463 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:30,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1951552688, now seen corresponding path program 1 times [2018-04-10 15:57:30,463 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:30,463 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:30,464 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:30,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:30,464 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:30,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:30,483 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:30,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:30,484 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:30,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:30,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:30,538 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |c_#length|))) is different from true [2018-04-10 15:57:30,540 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:57:30,560 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 16)))) is different from true [2018-04-10 15:57:30,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:30,570 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-04-10 15:57:30,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:30,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 39 [2018-04-10 15:57:30,587 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 15:57:30,587 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:30,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:30,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:30,625 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 50 [2018-04-10 15:57:30,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-04-10 15:57:30,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:30,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 36 [2018-04-10 15:57:30,675 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-04-10 15:57:30,710 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:57:30,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:57:30,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:30,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:30,762 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 15:57:30,762 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:30,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-10 15:57:30,780 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:36, output treesize:90 [2018-04-10 15:57:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 3 not checked. [2018-04-10 15:57:30,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:30,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 15:57:30,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:57:30,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:57:30,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=44, Unknown=3, NotChecked=42, Total=110 [2018-04-10 15:57:30,832 INFO L87 Difference]: Start difference. First operand 427 states and 477 transitions. Second operand 11 states. [2018-04-10 15:57:31,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:31,026 INFO L93 Difference]: Finished difference Result 447 states and 499 transitions. [2018-04-10 15:57:31,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 15:57:31,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2018-04-10 15:57:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:31,027 INFO L225 Difference]: With dead ends: 447 [2018-04-10 15:57:31,027 INFO L226 Difference]: Without dead ends: 447 [2018-04-10 15:57:31,027 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=134, Unknown=3, NotChecked=78, Total=272 [2018-04-10 15:57:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-04-10 15:57:31,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 401. [2018-04-10 15:57:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-10 15:57:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 448 transitions. [2018-04-10 15:57:31,030 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 448 transitions. Word has length 88 [2018-04-10 15:57:31,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:31,030 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 448 transitions. [2018-04-10 15:57:31,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:57:31,031 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 448 transitions. [2018-04-10 15:57:31,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-04-10 15:57:31,031 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:31,031 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:31,031 INFO L408 AbstractCegarLoop]: === Iteration 54 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:31,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1263639145, now seen corresponding path program 1 times [2018-04-10 15:57:31,031 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:31,031 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:31,032 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:31,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:31,032 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:31,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:31,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:31,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 15:57:31,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:57:31,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:57:31,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:57:31,092 INFO L87 Difference]: Start difference. First operand 401 states and 448 transitions. Second operand 8 states. [2018-04-10 15:57:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:31,195 INFO L93 Difference]: Finished difference Result 419 states and 464 transitions. [2018-04-10 15:57:31,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:57:31,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2018-04-10 15:57:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:31,196 INFO L225 Difference]: With dead ends: 419 [2018-04-10 15:57:31,196 INFO L226 Difference]: Without dead ends: 419 [2018-04-10 15:57:31,196 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:57:31,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-04-10 15:57:31,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 401. [2018-04-10 15:57:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-10 15:57:31,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 446 transitions. [2018-04-10 15:57:31,199 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 446 transitions. Word has length 90 [2018-04-10 15:57:31,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:31,199 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 446 transitions. [2018-04-10 15:57:31,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:57:31,199 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 446 transitions. [2018-04-10 15:57:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-04-10 15:57:31,199 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:31,199 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:31,199 INFO L408 AbstractCegarLoop]: === Iteration 55 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:31,200 INFO L82 PathProgramCache]: Analyzing trace with hash -489414892, now seen corresponding path program 1 times [2018-04-10 15:57:31,200 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:31,200 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:31,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:31,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:31,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:31,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:31,229 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:31,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:31,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:57:31,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:57:31,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:57:31,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:31,230 INFO L87 Difference]: Start difference. First operand 401 states and 446 transitions. Second operand 5 states. [2018-04-10 15:57:31,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:31,320 INFO L93 Difference]: Finished difference Result 407 states and 452 transitions. [2018-04-10 15:57:31,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:57:31,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-04-10 15:57:31,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:31,321 INFO L225 Difference]: With dead ends: 407 [2018-04-10 15:57:31,321 INFO L226 Difference]: Without dead ends: 407 [2018-04-10 15:57:31,322 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:57:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-04-10 15:57:31,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 404. [2018-04-10 15:57:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-04-10 15:57:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 450 transitions. [2018-04-10 15:57:31,324 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 450 transitions. Word has length 91 [2018-04-10 15:57:31,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:31,324 INFO L459 AbstractCegarLoop]: Abstraction has 404 states and 450 transitions. [2018-04-10 15:57:31,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:57:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 450 transitions. [2018-04-10 15:57:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-04-10 15:57:31,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:31,325 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:31,325 INFO L408 AbstractCegarLoop]: === Iteration 56 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:31,325 INFO L82 PathProgramCache]: Analyzing trace with hash -489414891, now seen corresponding path program 1 times [2018-04-10 15:57:31,325 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:31,325 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:31,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:31,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:31,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:31,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:31,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:31,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-10 15:57:31,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 15:57:31,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 15:57:31,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-10 15:57:31,504 INFO L87 Difference]: Start difference. First operand 404 states and 450 transitions. Second operand 12 states. [2018-04-10 15:57:31,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:31,787 INFO L93 Difference]: Finished difference Result 429 states and 484 transitions. [2018-04-10 15:57:31,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 15:57:31,788 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-04-10 15:57:31,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:31,789 INFO L225 Difference]: With dead ends: 429 [2018-04-10 15:57:31,789 INFO L226 Difference]: Without dead ends: 429 [2018-04-10 15:57:31,789 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-04-10 15:57:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-04-10 15:57:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 404. [2018-04-10 15:57:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-04-10 15:57:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 449 transitions. [2018-04-10 15:57:31,792 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 449 transitions. Word has length 91 [2018-04-10 15:57:31,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:31,792 INFO L459 AbstractCegarLoop]: Abstraction has 404 states and 449 transitions. [2018-04-10 15:57:31,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 15:57:31,792 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 449 transitions. [2018-04-10 15:57:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-10 15:57:31,793 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:31,793 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:31,793 INFO L408 AbstractCegarLoop]: === Iteration 57 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:31,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1255193315, now seen corresponding path program 1 times [2018-04-10 15:57:31,793 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:31,793 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:31,794 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:31,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:31,794 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:31,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:31,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:31,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 15:57:31,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 15:57:31,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 15:57:31,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-04-10 15:57:31,851 INFO L87 Difference]: Start difference. First operand 404 states and 449 transitions. Second operand 9 states. [2018-04-10 15:57:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:32,107 INFO L93 Difference]: Finished difference Result 428 states and 484 transitions. [2018-04-10 15:57:32,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:57:32,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-04-10 15:57:32,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:32,109 INFO L225 Difference]: With dead ends: 428 [2018-04-10 15:57:32,109 INFO L226 Difference]: Without dead ends: 428 [2018-04-10 15:57:32,109 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-10 15:57:32,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-04-10 15:57:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 417. [2018-04-10 15:57:32,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-04-10 15:57:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 467 transitions. [2018-04-10 15:57:32,112 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 467 transitions. Word has length 94 [2018-04-10 15:57:32,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:32,112 INFO L459 AbstractCegarLoop]: Abstraction has 417 states and 467 transitions. [2018-04-10 15:57:32,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 15:57:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 467 transitions. [2018-04-10 15:57:32,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-10 15:57:32,113 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:32,113 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:32,113 INFO L408 AbstractCegarLoop]: === Iteration 58 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:32,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1255193316, now seen corresponding path program 1 times [2018-04-10 15:57:32,113 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:32,113 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:32,113 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:32,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:32,114 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:32,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:32,126 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:32,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:32,126 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:32,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:32,193 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:32,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:32,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:32,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:32,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:57:32,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:57:32,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:32,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:32,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:32,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:32,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-10 15:57:32,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:57:32,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:32,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:32,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:32,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:32,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:128 [2018-04-10 15:57:32,609 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 200 treesize of output 194 [2018-04-10 15:57:32,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 200 [2018-04-10 15:57:32,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:32,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:32,699 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 180 treesize of output 174 [2018-04-10 15:57:32,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:32,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:32,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:32,845 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:211, output treesize:423 [2018-04-10 15:57:33,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:33,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:33,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:33,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:33,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 51 [2018-04-10 15:57:33,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:33,071 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 0 case distinctions, treesize of input 287 treesize of output 179 [2018-04-10 15:57:33,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 15:57:33,097 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:33,126 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 116 treesize of output 117 [2018-04-10 15:57:33,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 19 treesize of output 22 [2018-04-10 15:57:33,132 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 22 treesize of output 31 [2018-04-10 15:57:33,132 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,137 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:33,162 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 92 treesize of output 102 [2018-04-10 15:57:33,165 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 23 [2018-04-10 15:57:33,165 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:33,179 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:33,182 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 71 treesize of output 107 [2018-04-10 15:57:33,184 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:33,184 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 19 treesize of output 11 [2018-04-10 15:57:33,184 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,192 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,197 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,209 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:33,222 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 10 variables, input treesize:453, output treesize:84 [2018-04-10 15:57:33,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:33,370 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:33,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:33,371 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 0 case distinctions, treesize of input 90 treesize of output 76 [2018-04-10 15:57:33,373 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:33,378 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2018-04-10 15:57:33,378 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:33,393 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:33,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2018-04-10 15:57:33,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:33,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:33,422 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 36 treesize of output 38 [2018-04-10 15:57:33,424 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:33,424 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 11 treesize of output 7 [2018-04-10 15:57:33,424 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,430 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-10 15:57:33,430 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,433 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,440 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:116, output treesize:9 [2018-04-10 15:57:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:33,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:33,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-04-10 15:57:33,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 15:57:33,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 15:57:33,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=500, Unknown=3, NotChecked=0, Total=552 [2018-04-10 15:57:33,549 INFO L87 Difference]: Start difference. First operand 417 states and 467 transitions. Second operand 24 states. [2018-04-10 15:57:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:35,365 INFO L93 Difference]: Finished difference Result 488 states and 546 transitions. [2018-04-10 15:57:35,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 15:57:35,366 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 94 [2018-04-10 15:57:35,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:35,367 INFO L225 Difference]: With dead ends: 488 [2018-04-10 15:57:35,367 INFO L226 Difference]: Without dead ends: 488 [2018-04-10 15:57:35,367 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=1137, Unknown=7, NotChecked=0, Total=1260 [2018-04-10 15:57:35,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-04-10 15:57:35,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 452. [2018-04-10 15:57:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-04-10 15:57:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 512 transitions. [2018-04-10 15:57:35,370 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 512 transitions. Word has length 94 [2018-04-10 15:57:35,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:35,370 INFO L459 AbstractCegarLoop]: Abstraction has 452 states and 512 transitions. [2018-04-10 15:57:35,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 15:57:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 512 transitions. [2018-04-10 15:57:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-10 15:57:35,371 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:35,371 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:35,371 INFO L408 AbstractCegarLoop]: === Iteration 59 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:35,371 INFO L82 PathProgramCache]: Analyzing trace with hash 440557608, now seen corresponding path program 1 times [2018-04-10 15:57:35,371 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:35,371 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:35,372 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:35,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:35,372 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:35,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:35,384 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:35,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:35,385 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:35,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:35,442 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:35,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:35,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:35,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:35,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 15:57:35,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:57:35,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:35,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:35,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:35,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:35,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-10 15:57:35,800 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.offset| Int) (__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.offset Int) (__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base Int)) (let ((.cse1 (store |c_old(#valid)| __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base 1))) (let ((.cse0 (store .cse1 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1))) (and (= (select |c_old(#valid)| __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base) 0) (= |c_#valid| (store .cse0 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.base 1)) (<= (select .cse1 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select .cse0 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.base) 0) (= (let ((.cse3 (+ __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.offset 12))) (let ((.cse2 (let ((.cse4 (store |c_old(#memory_$Pointer$.offset)| __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base) (+ __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.offset 4) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.offset|) .cse3 0)))) (store .cse4 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.base (store (select .cse4 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.base) (+ c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.offset 4) 0))))) (store .cse2 __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base (store (select .cse2 __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base) .cse3 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.offset)))) |c_#memory_$Pointer$.offset|))))) is different from true [2018-04-10 15:57:35,806 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.offset Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.offset| Int) (__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.offset Int) (__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base Int)) (let ((.cse1 (store |c_old(#valid)| __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base 1))) (let ((.cse0 (store .cse1 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1))) (and (= (select |c_old(#valid)| __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base) 0) (= |c_#valid| (store .cse0 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.base 1)) (<= (select .cse1 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select .cse0 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.base) 0) (= |c_#memory_$Pointer$.offset| (let ((.cse2 (let ((.cse4 (+ __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.offset 12))) (let ((.cse3 (let ((.cse5 (store |c_old(#memory_$Pointer$.offset)| __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base) (+ __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.offset 4) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.offset|) .cse4 0)))) (store .cse5 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.base (store (select .cse5 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.base) (+ __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.offset 4) 0))))) (store .cse3 __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base (store (select .cse3 __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base) .cse4 __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.offset)))))) (store .cse2 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.base (store (select .cse2 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.base) (+ __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.offset 12) 0)))))))) is different from true [2018-04-10 15:57:35,813 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.offset Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.offset| Int) (__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.offset Int) (v_subst_2 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_2 1))) (let ((.cse1 (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1))) (and (<= (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (= |c_#valid| (store .cse1 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base 1)) (<= (select .cse1 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base) 0) (= |c_#memory_$Pointer$.offset| (let ((.cse2 (let ((.cse4 (+ __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.offset 12))) (let ((.cse3 (let ((.cse5 (store |c_old(#memory_$Pointer$.offset)| v_subst_2 (store (store (select |c_old(#memory_$Pointer$.offset)| v_subst_2) (+ __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.offset 4) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.offset|) .cse4 0)))) (store .cse5 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base (store (select .cse5 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base) (+ __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.offset 4) 0))))) (store .cse3 v_subst_2 (store (select .cse3 v_subst_2) .cse4 __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.offset)))))) (store .cse2 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base (store (select .cse2 c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base) (+ __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.offset 12) 0)))) (= (select |c_old(#valid)| v_subst_2) 0))))) is different from true [2018-04-10 15:57:35,820 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.offset Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.offset| Int) (__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.offset Int) (v_subst_2 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_2 1))) (let ((.cse5 (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1))) (and (<= (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (= |c_#memory_$Pointer$.offset| (let ((.cse1 (let ((.cse3 (+ __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.offset 12))) (let ((.cse2 (let ((.cse4 (store |c_old(#memory_$Pointer$.offset)| v_subst_2 (store (store (select |c_old(#memory_$Pointer$.offset)| v_subst_2) (+ __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.offset 4) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.offset|) .cse3 0)))) (store .cse4 |c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#res.base| (store (select .cse4 |c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#res.base|) (+ __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.offset 4) 0))))) (store .cse2 v_subst_2 (store (select .cse2 v_subst_2) .cse3 __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.offset)))))) (store .cse1 |c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#res.base| (store (select .cse1 |c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#res.base|) (+ __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~nextData~0.offset 12) 0)))) (= |c_#valid| (store .cse5 |c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#res.base| 1)) (<= (select .cse5 |c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#res.base|) 0) (= (select |c_old(#valid)| v_subst_2) 0))))) is different from true [2018-04-10 15:57:35,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:57:35,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:35,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:35,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:36,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:793, output treesize:870 [2018-04-10 15:57:36,299 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 1508 treesize of output 1438 [2018-04-10 15:57:36,310 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 1509 treesize of output 1508 [2018-04-10 15:57:36,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:36,648 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 1424 treesize of output 1354 [2018-04-10 15:57:36,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:37,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:37,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 15 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:37,420 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:1540, output treesize:2964 [2018-04-10 15:57:38,469 WARN L151 SmtUtils]: Spent 421ms on a formula simplification. DAG size of input: 130 DAG size of output 70 [2018-04-10 15:57:38,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,528 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 104 [2018-04-10 15:57:38,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 64 treesize of output 116 [2018-04-10 15:57:38,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 173 [2018-04-10 15:57:38,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 139 [2018-04-10 15:57:38,731 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:38,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:38,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2155 treesize of output 1151 [2018-04-10 15:57:39,497 WARN L148 SmtUtils]: Spent 212ms on a formula simplification that was a NOOP. DAG size: 72 [2018-04-10 15:57:39,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 15:57:39,502 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 902 treesize of output 737 [2018-04-10 15:57:39,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-10 15:57:39,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:39,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-10 15:57:39,598 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,609 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 680 treesize of output 342 [2018-04-10 15:57:39,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 18 treesize of output 17 [2018-04-10 15:57:39,678 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 281 treesize of output 267 [2018-04-10 15:57:39,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:39,740 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 25 treesize of output 27 [2018-04-10 15:57:39,740 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 165 [2018-04-10 15:57:39,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:39,786 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 43 [2018-04-10 15:57:39,786 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 148 [2018-04-10 15:57:39,821 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 23 [2018-04-10 15:57:39,821 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,842 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:39,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 148 [2018-04-10 15:57:39,848 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 14 treesize of output 7 [2018-04-10 15:57:39,848 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,862 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,871 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,879 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,887 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,896 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,904 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,912 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:39,939 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 19 variables, input treesize:2988, output treesize:179 [2018-04-10 15:57:40,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-04-10 15:57:40,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-10 15:57:40,036 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:40,050 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 3 [2018-04-10 15:57:40,050 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:40,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:40,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-10 15:57:40,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:40,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:40,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:40,084 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:193, output treesize:136 [2018-04-10 15:57:40,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 69 [2018-04-10 15:57:40,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2018-04-10 15:57:40,167 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:40,179 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:40,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 37 treesize of output 25 [2018-04-10 15:57:40,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:40,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:40,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:40,202 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:143, output treesize:66 [2018-04-10 15:57:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 3 not checked. [2018-04-10 15:57:40,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:40,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-10 15:57:40,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 15:57:40,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 15:57:40,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=485, Unknown=25, NotChecked=188, Total=756 [2018-04-10 15:57:40,312 INFO L87 Difference]: Start difference. First operand 452 states and 512 transitions. Second operand 28 states. [2018-04-10 15:57:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:46,139 INFO L93 Difference]: Finished difference Result 534 states and 611 transitions. [2018-04-10 15:57:46,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 15:57:46,140 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 93 [2018-04-10 15:57:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:46,141 INFO L225 Difference]: With dead ends: 534 [2018-04-10 15:57:46,141 INFO L226 Difference]: Without dead ends: 534 [2018-04-10 15:57:46,141 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=90, Invalid=762, Unknown=34, NotChecked=236, Total=1122 [2018-04-10 15:57:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-04-10 15:57:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 482. [2018-04-10 15:57:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-04-10 15:57:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 550 transitions. [2018-04-10 15:57:46,144 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 550 transitions. Word has length 93 [2018-04-10 15:57:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:46,144 INFO L459 AbstractCegarLoop]: Abstraction has 482 states and 550 transitions. [2018-04-10 15:57:46,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 15:57:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 550 transitions. [2018-04-10 15:57:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-10 15:57:46,145 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:46,145 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:46,145 INFO L408 AbstractCegarLoop]: === Iteration 60 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:46,145 INFO L82 PathProgramCache]: Analyzing trace with hash 440557609, now seen corresponding path program 1 times [2018-04-10 15:57:46,145 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:46,145 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:46,146 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:46,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:46,146 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:46,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:46,160 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:46,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:46,161 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:46,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:46,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:46,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:46,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:46,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:57:46,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:46,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:57:46,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:57:46,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:46,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:57:46,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:46,435 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:44 [2018-04-10 15:57:46,482 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 21 treesize of output 33 [2018-04-10 15:57:46,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-04-10 15:57:46,490 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:46,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 17 [2018-04-10 15:57:46,510 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:46,551 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 19 treesize of output 31 [2018-04-10 15:57:46,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 20 treesize of output 19 [2018-04-10 15:57:46,553 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,569 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,585 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 2 xjuncts. [2018-04-10 15:57:46,585 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:60, output treesize:90 [2018-04-10 15:57:46,640 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-10 15:57:46,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:46,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:46,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2018-04-10 15:57:46,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:46,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:116, output treesize:49 [2018-04-10 15:57:46,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:46,737 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:46,738 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 0 case distinctions, treesize of input 55 treesize of output 55 [2018-04-10 15:57:46,740 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:46,740 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 13 treesize of output 9 [2018-04-10 15:57:46,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,747 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:46,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-04-10 15:57:46,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:46,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:46,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-10 15:57:46,763 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:46,764 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 11 treesize of output 7 [2018-04-10 15:57:46,764 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,768 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:46,768 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 11 treesize of output 7 [2018-04-10 15:57:46,768 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,770 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:46,775 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:78, output treesize:9 [2018-04-10 15:57:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:46,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:46,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-04-10 15:57:46,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 15:57:46,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 15:57:46,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-04-10 15:57:46,800 INFO L87 Difference]: Start difference. First operand 482 states and 550 transitions. Second operand 19 states. [2018-04-10 15:57:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:48,034 INFO L93 Difference]: Finished difference Result 556 states and 640 transitions. [2018-04-10 15:57:48,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 15:57:48,034 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2018-04-10 15:57:48,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:48,035 INFO L225 Difference]: With dead ends: 556 [2018-04-10 15:57:48,035 INFO L226 Difference]: Without dead ends: 556 [2018-04-10 15:57:48,036 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2018-04-10 15:57:48,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-04-10 15:57:48,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 485. [2018-04-10 15:57:48,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-04-10 15:57:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 552 transitions. [2018-04-10 15:57:48,039 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 552 transitions. Word has length 93 [2018-04-10 15:57:48,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:48,040 INFO L459 AbstractCegarLoop]: Abstraction has 485 states and 552 transitions. [2018-04-10 15:57:48,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 15:57:48,040 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 552 transitions. [2018-04-10 15:57:48,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-10 15:57:48,040 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:48,040 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:48,040 INFO L408 AbstractCegarLoop]: === Iteration 61 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:57:48,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1211753416, now seen corresponding path program 1 times [2018-04-10 15:57:48,040 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:48,040 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:48,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:48,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:48,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:48,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:48,051 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:48,051 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:48,052 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:48,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:48,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:48,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:48,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:48,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:48,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:48,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:48,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:57:48,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:57:48,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:48,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:48,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:48,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:48,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:92, output treesize:85 [2018-04-10 15:57:48,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 73 [2018-04-10 15:57:48,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 81 [2018-04-10 15:57:48,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 treesize of output 76 [2018-04-10 15:57:48,508 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:48,518 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:48,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:48,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,539 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 87 [2018-04-10 15:57:48,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 98 [2018-04-10 15:57:48,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 93 [2018-04-10 15:57:48,578 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:48,593 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:48,607 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:48,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,648 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-04-10 15:57:48,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2018-04-10 15:57:48,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 88 [2018-04-10 15:57:48,658 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:48,681 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:48,687 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:48,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:48,717 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:95, output treesize:76 [2018-04-10 15:57:48,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 18 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 121 [2018-04-10 15:57:48,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:48,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:48,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2018-04-10 15:57:48,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:48,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:48,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:93, output treesize:98 [2018-04-10 15:57:49,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:49,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:49,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:49,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:49,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:49,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:49,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:49,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:49,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:49,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:49,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:49,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:49,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:49,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:49,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:49,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 47 [2018-04-10 15:57:49,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:49,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:49,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:115, output treesize:118 [2018-04-10 15:57:49,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 55 [2018-04-10 15:57:49,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 52 treesize of output 51 [2018-04-10 15:57:49,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:49,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:49,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:49,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:128, output treesize:124 [2018-04-10 15:57:49,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 50 [2018-04-10 15:57:49,267 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:49,267 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 46 treesize of output 48 [2018-04-10 15:57:49,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:49,281 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:49,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2018-04-10 15:57:49,283 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:49,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:49,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:49,316 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:133, output treesize:83 [2018-04-10 15:57:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:57:49,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:49,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 15:57:49,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 15:57:49,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 15:57:49,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=294, Unknown=8, NotChecked=0, Total=342 [2018-04-10 15:57:49,397 INFO L87 Difference]: Start difference. First operand 485 states and 552 transitions. Second operand 19 states. [2018-04-10 15:58:01,594 WARN L151 SmtUtils]: Spent 398ms on a formula simplification. DAG size of input: 99 DAG size of output 91 [2018-04-10 15:58:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:58:05,483 INFO L93 Difference]: Finished difference Result 613 states and 728 transitions. [2018-04-10 15:58:05,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 15:58:05,483 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 95 [2018-04-10 15:58:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:58:05,485 INFO L225 Difference]: With dead ends: 613 [2018-04-10 15:58:05,485 INFO L226 Difference]: Without dead ends: 613 [2018-04-10 15:58:05,485 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=99, Invalid=693, Unknown=20, NotChecked=0, Total=812 [2018-04-10 15:58:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-04-10 15:58:05,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 547. [2018-04-10 15:58:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-04-10 15:58:05,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 651 transitions. [2018-04-10 15:58:05,492 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 651 transitions. Word has length 95 [2018-04-10 15:58:05,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:58:05,492 INFO L459 AbstractCegarLoop]: Abstraction has 547 states and 651 transitions. [2018-04-10 15:58:05,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 15:58:05,492 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 651 transitions. [2018-04-10 15:58:05,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-10 15:58:05,492 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:58:05,492 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:58:05,492 INFO L408 AbstractCegarLoop]: === Iteration 62 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:58:05,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1211753417, now seen corresponding path program 1 times [2018-04-10 15:58:05,492 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:58:05,493 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:58:05,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:58:05,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:58:05,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:58:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:58:05,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:58:05,508 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:58:05,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:58:05,509 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:58:05,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:58:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:58:05,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:58:05,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:05,559 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 5 [2018-04-10 15:58:05,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-10 15:58:05,587 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-10 15:58:05,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:13 [2018-04-10 15:58:05,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:58:05,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:58:05,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:58:05,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:58:05,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:05,626 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:37, output treesize:23 [2018-04-10 15:58:05,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:05,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:05,701 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 15 treesize of output 8 [2018-04-10 15:58:05,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:05,711 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-10 15:58:05,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:05,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:46 [2018-04-10 15:58:05,763 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 32 treesize of output 40 [2018-04-10 15:58:05,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 33 treesize of output 32 [2018-04-10 15:58:05,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,827 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 35 treesize of output 43 [2018-04-10 15:58:05,830 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:05,830 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:05,832 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 29 treesize of output 38 [2018-04-10 15:58:05,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 32 treesize of output 31 [2018-04-10 15:58:05,847 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:05,865 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:83, output treesize:75 [2018-04-10 15:58:05,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38 [2018-04-10 15:58:05,895 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:05,895 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:05,895 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 34 treesize of output 38 [2018-04-10 15:58:05,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 14 [2018-04-10 15:58:05,907 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,917 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:05,917 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:05,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-10 15:58:05,919 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2018-04-10 15:58:05,942 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:05,942 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:05,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2018-04-10 15:58:05,943 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,954 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 26 treesize of output 11 [2018-04-10 15:58:05,954 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,963 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:05,964 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:05,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-10 15:58:05,965 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,970 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:05,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:05,977 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:93, output treesize:21 [2018-04-10 15:58:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:58:06,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:58:06,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-10 15:58:06,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 15:58:06,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 15:58:06,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=261, Unknown=1, NotChecked=0, Total=306 [2018-04-10 15:58:06,010 INFO L87 Difference]: Start difference. First operand 547 states and 651 transitions. Second operand 18 states. [2018-04-10 15:58:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:58:07,134 INFO L93 Difference]: Finished difference Result 581 states and 717 transitions. [2018-04-10 15:58:07,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 15:58:07,134 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2018-04-10 15:58:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:58:07,136 INFO L225 Difference]: With dead ends: 581 [2018-04-10 15:58:07,136 INFO L226 Difference]: Without dead ends: 581 [2018-04-10 15:58:07,136 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=914, Unknown=4, NotChecked=0, Total=1122 [2018-04-10 15:58:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-04-10 15:58:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 575. [2018-04-10 15:58:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-04-10 15:58:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 706 transitions. [2018-04-10 15:58:07,141 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 706 transitions. Word has length 95 [2018-04-10 15:58:07,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:58:07,141 INFO L459 AbstractCegarLoop]: Abstraction has 575 states and 706 transitions. [2018-04-10 15:58:07,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 15:58:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 706 transitions. [2018-04-10 15:58:07,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-10 15:58:07,141 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:58:07,142 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:58:07,142 INFO L408 AbstractCegarLoop]: === Iteration 63 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:58:07,142 INFO L82 PathProgramCache]: Analyzing trace with hash 256287223, now seen corresponding path program 1 times [2018-04-10 15:58:07,142 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:58:07,142 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:58:07,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:58:07,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:58:07,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:58:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:58:07,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:58:07,164 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:58:07,164 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:58:07,164 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:58:07,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:58:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:58:07,211 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:58:07,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:58:07,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:07,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:58:07,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:07,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:07,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:58:07,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 15:58:07,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 10 treesize of output 9 [2018-04-10 15:58:07,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:07,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:07,306 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-10 15:58:07,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-04-10 15:58:07,429 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 36 treesize of output 29 [2018-04-10 15:58:07,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:07,430 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:07,431 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 29 treesize of output 49 [2018-04-10 15:58:07,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:07,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:07,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:07,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:60 [2018-04-10 15:58:07,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:07,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-04-10 15:58:07,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:58:07,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:07,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:07,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:58:07,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:58:07,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:07,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:07,587 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-10 15:58:07,587 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:101 [2018-04-10 15:58:07,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:07,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:07,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, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 69 [2018-04-10 15:58:07,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-04-10 15:58:07,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:07,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:07,709 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 77 treesize of output 81 [2018-04-10 15:58:07,712 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 78 treesize of output 77 [2018-04-10 15:58:07,712 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:07,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:07,758 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 79 [2018-04-10 15:58:07,758 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:58:07,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:58:07,847 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 2 xjuncts. [2018-04-10 15:58:07,847 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:117, output treesize:297 [2018-04-10 15:58:07,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:07,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:07,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:07,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:07,989 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 125 [2018-04-10 15:58:08,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:08,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:08,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:08,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:08,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:08,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 37 treesize of output 87 [2018-04-10 15:58:08,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:08,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:08,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 15:58:08,026 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:08,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:08,036 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:245, output treesize:107 [2018-04-10 15:58:08,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:08,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:08,129 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 112 treesize of output 91 [2018-04-10 15:58:08,131 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:08,135 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 50 [2018-04-10 15:58:08,135 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:58:08,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-04-10 15:58:08,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:08,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:08,162 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 1 xjuncts. [2018-04-10 15:58:08,163 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:136, output treesize:62 [2018-04-10 15:58:08,265 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 53 treesize of output 49 [2018-04-10 15:58:08,266 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:08,267 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 17 treesize of output 11 [2018-04-10 15:58:08,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:08,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-04-10 15:58:08,274 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:08,278 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 3 [2018-04-10 15:58:08,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:08,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:08,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:08,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:68, output treesize:3 [2018-04-10 15:58:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-10 15:58:08,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:58:08,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-10 15:58:08,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 15:58:08,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 15:58:08,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2018-04-10 15:58:08,349 INFO L87 Difference]: Start difference. First operand 575 states and 706 transitions. Second operand 27 states. [2018-04-10 15:58:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:58:10,283 INFO L93 Difference]: Finished difference Result 607 states and 744 transitions. [2018-04-10 15:58:10,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 15:58:10,283 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 95 [2018-04-10 15:58:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:58:10,284 INFO L225 Difference]: With dead ends: 607 [2018-04-10 15:58:10,284 INFO L226 Difference]: Without dead ends: 607 [2018-04-10 15:58:10,284 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=187, Invalid=1975, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 15:58:10,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-04-10 15:58:10,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 590. [2018-04-10 15:58:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-04-10 15:58:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 723 transitions. [2018-04-10 15:58:10,289 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 723 transitions. Word has length 95 [2018-04-10 15:58:10,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:58:10,289 INFO L459 AbstractCegarLoop]: Abstraction has 590 states and 723 transitions. [2018-04-10 15:58:10,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 15:58:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 723 transitions. [2018-04-10 15:58:10,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-04-10 15:58:10,289 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:58:10,289 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:58:10,289 INFO L408 AbstractCegarLoop]: === Iteration 64 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:58:10,289 INFO L82 PathProgramCache]: Analyzing trace with hash -645030493, now seen corresponding path program 1 times [2018-04-10 15:58:10,290 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:58:10,290 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:58:10,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:58:10,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:58:10,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:58:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:58:10,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:58:10,305 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:58:10,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:58:10,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:58:10,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:58:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:58:10,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:58:10,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:58:10,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:10,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:58:10,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:10,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:10,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:58:10,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 15:58:10,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:58:10,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:10,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:10,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:10,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:53 [2018-04-10 15:58:10,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-04-10 15:58:10,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:10,591 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 49 treesize of output 62 [2018-04-10 15:58:10,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:10,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:10,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:10,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:62 [2018-04-10 15:58:10,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:58:10,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:58:10,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:10,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:10,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:10,719 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 66 treesize of output 67 [2018-04-10 15:58:10,721 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-10 15:58:10,721 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:10,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:10,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:10,751 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:107, output treesize:124 [2018-04-10 15:58:10,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:10,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:10,819 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 3 case distinctions, treesize of input 106 treesize of output 113 [2018-04-10 15:58:10,823 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 123 treesize of output 122 [2018-04-10 15:58:10,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:10,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:10,880 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 88 [2018-04-10 15:58:10,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:58:10,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:58:10,969 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 19 treesize of output 31 [2018-04-10 15:58:10,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-04-10 15:58:10,978 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 15:58:11,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 15:58:11,002 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:11,011 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:11,060 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 2 xjuncts. [2018-04-10 15:58:11,060 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:150, output treesize:367 [2018-04-10 15:58:11,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,225 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 178 [2018-04-10 15:58:11,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 90 treesize of output 228 [2018-04-10 15:58:11,252 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 99 treesize of output 182 [2018-04-10 15:58:11,253 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:11,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:11,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:11,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,304 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 70 [2018-04-10 15:58:11,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 124 [2018-04-10 15:58:11,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 48 [2018-04-10 15:58:11,330 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:11,331 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 15:58:11,331 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:11,334 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:11,336 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:11,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:11,355 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:387, output treesize:223 [2018-04-10 15:58:11,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,432 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:11,434 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 216 [2018-04-10 15:58:11,435 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:11,436 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 15 treesize of output 11 [2018-04-10 15:58:11,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:11,454 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:11,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 154 [2018-04-10 15:58:11,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:11,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:11,487 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 1 xjuncts. [2018-04-10 15:58:11,487 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:257, output treesize:174 [2018-04-10 15:58:11,595 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:11,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,597 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:11,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:11,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 109 [2018-04-10 15:58:11,605 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:11,609 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 39 [2018-04-10 15:58:11,610 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:58:11,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 47 [2018-04-10 15:58:11,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 15:58:11,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-04-10 15:58:11,632 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:11,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 40 [2018-04-10 15:58:11,658 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:11,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 62 treesize of output 44 [2018-04-10 15:58:11,660 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:11,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 58 treesize of output 40 [2018-04-10 15:58:11,661 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:11,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-10 15:58:11,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-04-10 15:58:11,713 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:175, output treesize:136 [2018-04-10 15:58:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:58:11,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:58:11,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-04-10 15:58:11,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 15:58:11,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 15:58:11,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2018-04-10 15:58:11,836 INFO L87 Difference]: Start difference. First operand 590 states and 723 transitions. Second operand 23 states. [2018-04-10 15:58:16,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:58:16,643 INFO L93 Difference]: Finished difference Result 629 states and 762 transitions. [2018-04-10 15:58:16,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 15:58:16,643 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 96 [2018-04-10 15:58:16,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:58:16,645 INFO L225 Difference]: With dead ends: 629 [2018-04-10 15:58:16,645 INFO L226 Difference]: Without dead ends: 629 [2018-04-10 15:58:16,645 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=118, Invalid=1141, Unknown=1, NotChecked=0, Total=1260 [2018-04-10 15:58:16,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-04-10 15:58:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 603. [2018-04-10 15:58:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-04-10 15:58:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 738 transitions. [2018-04-10 15:58:16,650 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 738 transitions. Word has length 96 [2018-04-10 15:58:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:58:16,650 INFO L459 AbstractCegarLoop]: Abstraction has 603 states and 738 transitions. [2018-04-10 15:58:16,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 15:58:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 738 transitions. [2018-04-10 15:58:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-04-10 15:58:16,651 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:58:16,651 INFO L355 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:58:16,651 INFO L408 AbstractCegarLoop]: === Iteration 65 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:58:16,651 INFO L82 PathProgramCache]: Analyzing trace with hash -29728814, now seen corresponding path program 1 times [2018-04-10 15:58:16,651 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:58:16,651 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:58:16,652 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:58:16,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:58:16,652 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:58:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:58:16,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:58:16,672 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:58:16,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:58:16,672 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:58:16,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:58:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:58:16,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:58:16,746 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (let ((.cse0 (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1))) (and (<= (select (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base|) 0) (<= (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 16))))) is different from true [2018-04-10 15:58:16,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:16,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:16,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:16,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:16,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:16,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:16,767 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 63 [2018-04-10 15:58:16,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:16,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:16,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:16,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:16,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:16,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:16,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:16,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 50 [2018-04-10 15:58:16,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:16,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:16,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-04-10 15:58:16,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:16,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-04-10 15:58:16,810 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 30 treesize of output 53 [2018-04-10 15:58:16,811 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:16,819 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:16,823 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:16,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:16,832 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-04-10 15:58:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 3 not checked. [2018-04-10 15:58:16,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:58:16,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-10 15:58:16,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 15:58:16,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 15:58:16,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=4, NotChecked=14, Total=90 [2018-04-10 15:58:16,893 INFO L87 Difference]: Start difference. First operand 603 states and 738 transitions. Second operand 10 states. [2018-04-10 15:58:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:58:17,226 INFO L93 Difference]: Finished difference Result 632 states and 773 transitions. [2018-04-10 15:58:17,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 15:58:17,226 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 171 [2018-04-10 15:58:17,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:58:17,227 INFO L225 Difference]: With dead ends: 632 [2018-04-10 15:58:17,228 INFO L226 Difference]: Without dead ends: 632 [2018-04-10 15:58:17,228 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=4, NotChecked=20, Total=156 [2018-04-10 15:58:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-04-10 15:58:17,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 603. [2018-04-10 15:58:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-04-10 15:58:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 736 transitions. [2018-04-10 15:58:17,232 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 736 transitions. Word has length 171 [2018-04-10 15:58:17,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:58:17,233 INFO L459 AbstractCegarLoop]: Abstraction has 603 states and 736 transitions. [2018-04-10 15:58:17,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 15:58:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 736 transitions. [2018-04-10 15:58:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-10 15:58:17,233 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:58:17,233 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:58:17,233 INFO L408 AbstractCegarLoop]: === Iteration 66 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:58:17,233 INFO L82 PathProgramCache]: Analyzing trace with hash 236092529, now seen corresponding path program 1 times [2018-04-10 15:58:17,233 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:58:17,233 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:58:17,234 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:58:17,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:58:17,234 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:58:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:58:17,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:58:17,249 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:58:17,249 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:58:17,249 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:58:17,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:58:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:58:17,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:58:17,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:58:17,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:17,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:58:17,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:17,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:17,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:58:17,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:58:17,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:58:17,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:17,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:17,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:17,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:36 [2018-04-10 15:58:17,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:58:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:58:17,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:17,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:17,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:58:17,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:58:17,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:17,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:17,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:17,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:55, output treesize:53 [2018-04-10 15:58:17,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:17,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:17,649 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 15 treesize of output 8 [2018-04-10 15:58:17,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:17,660 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 13 treesize of output 3 [2018-04-10 15:58:17,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:17,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:17,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:41 [2018-04-10 15:58:17,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:17,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:17,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:17,839 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 62 [2018-04-10 15:58:17,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:17,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:17,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:82 [2018-04-10 15:58:17,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:17,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:17,979 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 83 [2018-04-10 15:58:17,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 85 treesize of output 84 [2018-04-10 15:58:17,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:18,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:18,074 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 3 case distinctions, treesize of input 32 treesize of output 40 [2018-04-10 15:58:18,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 33 treesize of output 32 [2018-04-10 15:58:18,077 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:18,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:18,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:18,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:119, output treesize:111 [2018-04-10 15:58:18,156 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 1 case distinctions, treesize of input 37 treesize of output 35 [2018-04-10 15:58:18,158 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:18,159 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:18,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-04-10 15:58:18,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:18,171 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 26 treesize of output 11 [2018-04-10 15:58:18,171 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:18,181 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:18,182 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:18,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2018-04-10 15:58:18,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:18,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:18,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:18,207 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:129, output treesize:99 [2018-04-10 15:58:18,243 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:18,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:18,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 75 [2018-04-10 15:58:18,251 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 66 treesize of output 55 [2018-04-10 15:58:18,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:18,271 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:18,272 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 42 treesize of output 36 [2018-04-10 15:58:18,272 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:18,288 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:18,289 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:18,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-10 15:58:18,291 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:18,306 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:18,306 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 33 treesize of output 30 [2018-04-10 15:58:18,306 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:18,319 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:18,320 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 32 treesize of output 26 [2018-04-10 15:58:18,320 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:18,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 15:58:18,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 15:58:18,350 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:103, output treesize:49 [2018-04-10 15:58:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:58:18,463 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:58:18,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-10 15:58:18,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 15:58:18,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 15:58:18,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=591, Unknown=1, NotChecked=0, Total=650 [2018-04-10 15:58:18,464 INFO L87 Difference]: Start difference. First operand 603 states and 736 transitions. Second operand 26 states. [2018-04-10 15:58:20,266 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 135 DAG size of output 94 [2018-04-10 15:58:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:58:21,447 INFO L93 Difference]: Finished difference Result 766 states and 937 transitions. [2018-04-10 15:58:21,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 15:58:21,448 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-04-10 15:58:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:58:21,449 INFO L225 Difference]: With dead ends: 766 [2018-04-10 15:58:21,449 INFO L226 Difference]: Without dead ends: 766 [2018-04-10 15:58:21,450 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=278, Invalid=2171, Unknown=1, NotChecked=0, Total=2450 [2018-04-10 15:58:21,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2018-04-10 15:58:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 718. [2018-04-10 15:58:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-04-10 15:58:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 878 transitions. [2018-04-10 15:58:21,455 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 878 transitions. Word has length 99 [2018-04-10 15:58:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:58:21,455 INFO L459 AbstractCegarLoop]: Abstraction has 718 states and 878 transitions. [2018-04-10 15:58:21,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 15:58:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 878 transitions. [2018-04-10 15:58:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-10 15:58:21,456 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:58:21,456 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:58:21,456 INFO L408 AbstractCegarLoop]: === Iteration 67 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:58:21,456 INFO L82 PathProgramCache]: Analyzing trace with hash 236092530, now seen corresponding path program 1 times [2018-04-10 15:58:21,456 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:58:21,456 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:58:21,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:58:21,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:58:21,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:58:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:58:21,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:58:21,471 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:58:21,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:58:21,471 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:58:21,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:58:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:58:21,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:58:21,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:58:21,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:21,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:58:21,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:21,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:21,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:58:21,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:58:21,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:58:21,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:21,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:21,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:58:21,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:58:21,595 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:21,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:21,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:21,601 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-10 15:58:21,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 15:58:21,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:58:21,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:21,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:21,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:21,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:70 [2018-04-10 15:58:22,935 WARN L151 SmtUtils]: Spent 539ms on a formula simplification. DAG size of input: 102 DAG size of output 96 [2018-04-10 15:58:22,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:22,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:22,947 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-04-10 15:58:22,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:22,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:22,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:22,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 52 [2018-04-10 15:58:22,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:22,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:22,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:22,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:22,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:22,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:22,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 81 [2018-04-10 15:58:22,981 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:23,050 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:23,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:23,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,161 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 44 [2018-04-10 15:58:23,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,208 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 2 case distinctions, treesize of input 37 treesize of output 63 [2018-04-10 15:58:23,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 96 [2018-04-10 15:58:23,259 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:23,365 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:23,495 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:23,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,818 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 65 [2018-04-10 15:58:23,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 30 treesize of output 65 [2018-04-10 15:58:23,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 41 treesize of output 60 [2018-04-10 15:58:23,873 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:23,915 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:23,958 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:23,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:23,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,033 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 75 [2018-04-10 15:58:24,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 82 [2018-04-10 15:58:24,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 77 [2018-04-10 15:58:24,148 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:24,255 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:24,346 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:24,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,585 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 0 case distinctions, treesize of input 159 treesize of output 93 [2018-04-10 15:58:24,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:58:24,620 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:24,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,736 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 66 treesize of output 67 [2018-04-10 15:58:24,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-04-10 15:58:24,747 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-10 15:58:24,747 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:24,757 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:24,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,819 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 58 treesize of output 60 [2018-04-10 15:58:24,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,827 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 16 treesize of output 23 [2018-04-10 15:58:24,827 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:24,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:24,909 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 6 case distinctions, treesize of input 49 treesize of output 97 [2018-04-10 15:58:24,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2018-04-10 15:58:24,915 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:25,095 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 47 treesize of output 44 [2018-04-10 15:58:25,096 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:25,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:25,228 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:25,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:25,232 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 45 treesize of output 54 [2018-04-10 15:58:25,233 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:25,379 INFO L267 ElimStorePlain]: Start of recursive call 21: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:58:25,437 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:58:25,511 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:58:25,575 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:58:25,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:25,720 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 0 case distinctions, treesize of input 159 treesize of output 93 [2018-04-10 15:58:25,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:58:25,753 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:25,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:25,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:25,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:25,790 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 66 treesize of output 67 [2018-04-10 15:58:25,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 15:58:25,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-04-10 15:58:25,798 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:25,804 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:25,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:25,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:25,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:25,828 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 58 treesize of output 60 [2018-04-10 15:58:25,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:25,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 15:58:25,833 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:25,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:25,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:25,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:25,871 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 90 [2018-04-10 15:58:25,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 70 treesize of output 69 [2018-04-10 15:58:25,875 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:25,954 INFO L267 ElimStorePlain]: Start of recursive call 32: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:25,962 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:25,970 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:25,978 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:26,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-10 15:58:26,046 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 12 variables, input treesize:412, output treesize:643 [2018-04-10 15:58:26,279 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 148 DAG size of output 141 [2018-04-10 15:58:26,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 286 treesize of output 290 [2018-04-10 15:58:26,634 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 281 treesize of output 266 [2018-04-10 15:58:26,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:26,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 260 [2018-04-10 15:58:26,723 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 15:58:26,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:58:27,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 148 [2018-04-10 15:58:27,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 130 [2018-04-10 15:58:27,057 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 15:58:27,152 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 139 treesize of output 124 [2018-04-10 15:58:27,152 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:27,226 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:58:27,474 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:27,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 218 [2018-04-10 15:58:27,476 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:27,476 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 21 treesize of output 17 [2018-04-10 15:58:27,476 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:27,494 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:27,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 13 dim-0 vars, and 7 xjuncts. [2018-04-10 15:58:27,751 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:678, output treesize:1302 [2018-04-10 15:58:28,720 WARN L151 SmtUtils]: Spent 792ms on a formula simplification. DAG size of input: 304 DAG size of output 303 [2018-04-10 15:58:29,338 WARN L148 SmtUtils]: Spent 403ms on a formula simplification that was a NOOP. DAG size: 303 [2018-04-10 15:58:30,210 WARN L151 SmtUtils]: Spent 663ms on a formula simplification. DAG size of input: 308 DAG size of output 304 [2018-04-10 15:58:33,172 WARN L151 SmtUtils]: Spent 2726ms on a formula simplification. DAG size of input: 303 DAG size of output 303 [2018-04-10 15:58:33,596 WARN L148 SmtUtils]: Spent 224ms on a formula simplification that was a NOOP. DAG size: 203 [2018-04-10 15:58:36,081 WARN L148 SmtUtils]: Spent 2230ms on a formula simplification that was a NOOP. DAG size: 203 [2018-04-10 15:58:36,473 WARN L148 SmtUtils]: Spent 227ms on a formula simplification that was a NOOP. DAG size: 203 [2018-04-10 15:58:36,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 399 [2018-04-10 15:58:36,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:36,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 22 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 542 [2018-04-10 15:58:36,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:36,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:36,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 265 treesize of output 628 [2018-04-10 15:58:36,833 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:37,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 250 [2018-04-10 15:58:37,017 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:37,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 402 [2018-04-10 15:58:37,174 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:37,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,317 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 134 treesize of output 161 [2018-04-10 15:58:37,317 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:37,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 162 [2018-04-10 15:58:37,448 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:37,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:37,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 17 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 221 [2018-04-10 15:58:37,582 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:37,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 8 dim-1 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-04-10 15:58:37,709 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 18 variables, input treesize:813, output treesize:659 [2018-04-10 15:58:38,084 WARN L148 SmtUtils]: Spent 216ms on a formula simplification that was a NOOP. DAG size: 186 [2018-04-10 15:58:38,487 WARN L148 SmtUtils]: Spent 207ms on a formula simplification that was a NOOP. DAG size: 186 [2018-04-10 15:58:38,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 145 [2018-04-10 15:58:38,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:38,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 356 [2018-04-10 15:58:38,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:38,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 352 [2018-04-10 15:58:38,788 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:38,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:38,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 145 [2018-04-10 15:58:38,941 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:39,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-1 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-04-10 15:58:39,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 14 variables, input treesize:727, output treesize:949 [2018-04-10 15:58:39,608 WARN L148 SmtUtils]: Spent 344ms on a formula simplification that was a NOOP. DAG size: 216 [2018-04-10 15:58:39,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:39,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:39,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:39,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:39,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:39,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:39,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:39,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:39,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 348 treesize of output 433 [2018-04-10 15:58:39,717 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 408 treesize of output 511 [2018-04-10 15:58:39,717 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-04-10 15:58:40,402 INFO L267 ElimStorePlain]: Start of recursive call 3: 1025 dim-0 vars, End of recursive call: 1025 dim-0 vars, and 485 xjuncts. [2018-04-10 15:58:51,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 345 treesize of output 344 [2018-04-10 15:58:51,991 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:52,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:58:52,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 168 treesize of output 176 [2018-04-10 15:58:52,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 165 treesize of output 164 [2018-04-10 15:58:52,588 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:52,676 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:53,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:53,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:53,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:53,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:53,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:53,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:53,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 360 treesize of output 332 [2018-04-10 15:58:53,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 413 treesize of output 412 [2018-04-10 15:58:53,100 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:53,332 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:53,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:53,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:53,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 352 treesize of output 364 [2018-04-10 15:58:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:58:53,744 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:53,783 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:54,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:54,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:54,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 173 [2018-04-10 15:58:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 15:58:54,140 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:54,171 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:54,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:54,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:54,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:54,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:54,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:54,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 160 treesize of output 212 [2018-04-10 15:58:54,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 209 treesize of output 208 [2018-04-10 15:58:54,544 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:54,666 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 172 [2018-04-10 15:58:54,667 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-10 15:58:54,752 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:58:55,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 157 [2018-04-10 15:58:55,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:58:55,159 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:55,189 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:55,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:55,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:55,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:55,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:55,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:55,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:55,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:55,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:55,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 344 treesize of output 349 [2018-04-10 15:58:55,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 49 treesize of output 34 [2018-04-10 15:58:55,549 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:55,612 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:55,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:55,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:55,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:55,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:55,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 344 treesize of output 291 [2018-04-10 15:58:55,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 14 treesize of output 13 [2018-04-10 15:58:55,629 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:55,672 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:55,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 8 dim-2 vars, End of recursive call: 13 dim-0 vars, and 6 xjuncts. [2018-04-10 15:58:55,979 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 22 variables, input treesize:1041, output treesize:1425 [2018-04-10 15:58:56,929 WARN L151 SmtUtils]: Spent 717ms on a formula simplification. DAG size of input: 297 DAG size of output 219 [2018-04-10 15:58:56,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:56,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:56,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:56,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:56,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:56,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:56,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:56,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:56,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 345 treesize of output 362 [2018-04-10 15:58:56,960 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 337 treesize of output 319 [2018-04-10 15:58:56,961 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:58:57,152 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:57,152 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 285 treesize of output 279 [2018-04-10 15:58:57,153 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:57,154 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:57,155 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 291 treesize of output 285 [2018-04-10 15:58:57,155 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:57,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 316 [2018-04-10 15:58:57,307 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:57,449 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 273 treesize of output 270 [2018-04-10 15:58:57,449 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:57,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:57,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:57,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 279 treesize of output 290 [2018-04-10 15:58:57,456 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-10 15:58:57,617 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 266 treesize of output 261 [2018-04-10 15:58:57,617 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:57,649 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 262 treesize of output 257 [2018-04-10 15:58:57,649 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:57,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 312 treesize of output 282 [2018-04-10 15:58:57,770 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:57,891 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:57,892 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 282 treesize of output 276 [2018-04-10 15:58:57,892 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:58,012 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 270 treesize of output 265 [2018-04-10 15:58:58,012 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:58,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-10 15:58:58,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 147 [2018-04-10 15:58:58,397 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:58,397 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 16 treesize of output 10 [2018-04-10 15:58:58,398 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:58,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-10 15:58:58,424 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:58,450 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:58,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:58,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:58,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 353 treesize of output 322 [2018-04-10 15:58:58,706 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:58,706 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 16 treesize of output 10 [2018-04-10 15:58:58,706 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:58,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 15:58:58,747 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:58,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 182 [2018-04-10 15:58:58,781 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:58,814 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:59,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:59,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:59,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:59,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:59,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:59,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 185 [2018-04-10 15:58:59,070 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 177 [2018-04-10 15:58:59,071 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:58:59,214 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:59,214 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 157 treesize of output 151 [2018-04-10 15:58:59,214 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:59,216 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:59,216 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 151 treesize of output 145 [2018-04-10 15:58:59,217 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:59,341 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 142 treesize of output 139 [2018-04-10 15:58:59,342 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:59,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:59,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:59,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 159 [2018-04-10 15:58:59,349 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-04-10 15:58:59,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 154 [2018-04-10 15:58:59,474 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:59,584 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:58:59,585 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 154 treesize of output 148 [2018-04-10 15:58:59,585 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:59,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 143 [2018-04-10 15:58:59,693 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:59,802 INFO L267 ElimStorePlain]: Start of recursive call 21: 6 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-10 15:59:00,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 4 dim-2 vars, End of recursive call: 34 dim-0 vars, and 8 xjuncts. [2018-04-10 15:59:00,140 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 22 variables, input treesize:1021, output treesize:1523 [2018-04-10 15:59:04,541 WARN L151 SmtUtils]: Spent 4121ms on a formula simplification. DAG size of input: 424 DAG size of output 219 [2018-04-10 15:59:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:59:04,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:59:04,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-10 15:59:04,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 15:59:04,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 15:59:04,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1106, Unknown=9, NotChecked=0, Total=1190 [2018-04-10 15:59:04,706 INFO L87 Difference]: Start difference. First operand 718 states and 878 transitions. Second operand 35 states. [2018-04-10 15:59:06,485 WARN L151 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 80 DAG size of output 69 [2018-04-10 15:59:08,338 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 229 DAG size of output 149 [2018-04-10 15:59:08,825 WARN L151 SmtUtils]: Spent 271ms on a formula simplification. DAG size of input: 260 DAG size of output 160 [2018-04-10 15:59:09,725 WARN L151 SmtUtils]: Spent 667ms on a formula simplification. DAG size of input: 442 DAG size of output 238 [2018-04-10 15:59:11,181 WARN L151 SmtUtils]: Spent 1198ms on a formula simplification. DAG size of input: 448 DAG size of output 313 [2018-04-10 15:59:12,041 WARN L151 SmtUtils]: Spent 608ms on a formula simplification. DAG size of input: 399 DAG size of output 225 [2018-04-10 15:59:13,301 WARN L151 SmtUtils]: Spent 1031ms on a formula simplification. DAG size of input: 409 DAG size of output 238 [2018-04-10 15:59:14,289 WARN L151 SmtUtils]: Spent 785ms on a formula simplification. DAG size of input: 404 DAG size of output 192 [2018-04-10 15:59:17,419 WARN L148 SmtUtils]: Spent 2846ms on a formula simplification that was a NOOP. DAG size: 212 [2018-04-10 15:59:18,221 WARN L151 SmtUtils]: Spent 571ms on a formula simplification. DAG size of input: 288 DAG size of output 227 [2018-04-10 15:59:27,212 WARN L151 SmtUtils]: Spent 8662ms on a formula simplification. DAG size of input: 329 DAG size of output 257 [2018-04-10 15:59:34,343 WARN L151 SmtUtils]: Spent 6660ms on a formula simplification. DAG size of input: 372 DAG size of output 271 Received shutdown request... [2018-04-10 16:00:04,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 16:00:04,193 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 16:00:04,196 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 16:00:04,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:00:04 BoogieIcfgContainer [2018-04-10 16:00:04,197 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:00:04,197 INFO L168 Benchmark]: Toolchain (without parser) took 187897.50 ms. Allocated memory was 394.3 MB in the beginning and 1.2 GB in the end (delta: 812.1 MB). Free memory was 328.1 MB in the beginning and 498.1 MB in the end (delta: -170.0 MB). Peak memory consumption was 642.1 MB. Max. memory is 5.3 GB. [2018-04-10 16:00:04,198 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 394.3 MB. Free memory is still 355.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:00:04,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.98 ms. Allocated memory is still 394.3 MB. Free memory was 328.1 MB in the beginning and 300.2 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. [2018-04-10 16:00:04,198 INFO L168 Benchmark]: Boogie Preprocessor took 48.85 ms. Allocated memory is still 394.3 MB. Free memory was 300.2 MB in the beginning and 297.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-10 16:00:04,198 INFO L168 Benchmark]: RCFGBuilder took 574.62 ms. Allocated memory was 394.3 MB in the beginning and 597.7 MB in the end (delta: 203.4 MB). Free memory was 297.5 MB in the beginning and 497.6 MB in the end (delta: -200.0 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-10 16:00:04,199 INFO L168 Benchmark]: TraceAbstraction took 187010.53 ms. Allocated memory was 597.7 MB in the beginning and 1.2 GB in the end (delta: 608.7 MB). Free memory was 497.6 MB in the beginning and 498.1 MB in the end (delta: -554.5 kB). Peak memory consumption was 608.1 MB. Max. memory is 5.3 GB. [2018-04-10 16:00:04,199 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 394.3 MB. Free memory is still 355.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 260.98 ms. Allocated memory is still 394.3 MB. Free memory was 328.1 MB in the beginning and 300.2 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.85 ms. Allocated memory is still 394.3 MB. Free memory was 300.2 MB in the beginning and 297.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 574.62 ms. Allocated memory was 394.3 MB in the beginning and 597.7 MB in the end (delta: 203.4 MB). Free memory was 297.5 MB in the beginning and 497.6 MB in the end (delta: -200.0 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 187010.53 ms. Allocated memory was 597.7 MB in the beginning and 1.2 GB in the end (delta: 608.7 MB). Free memory was 497.6 MB in the beginning and 498.1 MB in the end (delta: -554.5 kB). Peak memory consumption was 608.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 583]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 583]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 592]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 595]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 596]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 595]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 586]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 585]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 585). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 593]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 593]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 592]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 595]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 595]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 596]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 586]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 593]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 593]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 561]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 562]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 561]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 563]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 561]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 561]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 562]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 563]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (718states) and interpolant automaton (currently 32 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 456. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 227 locations, 91 error locations. TIMEOUT Result, 186.9s OverallTime, 67 OverallIterations, 8 TraceHistogramMax, 112.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10410 SDtfs, 6605 SDslu, 37376 SDs, 0 SdLazy, 36404 SolverSat, 740 SolverUnsat, 457 SolverUnknown, 0 SolverNotchecked, 36.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3715 GetRequests, 2835 SyntacticMatches, 22 SemanticMatches, 857 ConstructedPredicates, 56 IntricatePredicates, 0 DeprecatedPredicates, 2759 ImplicationChecksByTransitivity, 69.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=718occurred in iteration=66, 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.3s AutomataMinimizationTime, 66 MinimizatonAttempts, 1368 StatesRemovedByMinimization, 59 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 71.6s InterpolantComputationTime, 8099 NumberOfCodeBlocks, 8099 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 4752 ConstructedInterpolants, 1795 QuantifiedInterpolants, 10336606 SizeOfPredicates, 444 NumberOfNonLiveVariables, 13024 ConjunctsInSsa, 1317 ConjunctsInUnsatCore, 68 InterpolantComputations, 48 PerfectInterpolantSequences, 1652/1750 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/complex_data_creation_test02_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_16-00-04-206.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_16-00-04-206.csv Completed graceful shutdown