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/optional_data_creation_test04_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:00:05,853 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:00:05,854 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:00:05,864 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:00:05,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:00:05,864 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:00:05,865 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:00:05,866 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:00:05,867 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:00:05,867 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:00:05,868 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:00:05,868 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:00:05,868 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:00:05,869 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:00:05,869 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:00:05,870 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:00:05,871 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:00:05,872 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:00:05,873 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:00:05,874 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:00:05,875 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:00:05,875 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:00:05,875 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:00:05,876 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:00:05,876 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:00:05,877 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:00:05,877 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:00:05,877 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:00:05,878 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:00:05,878 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:00:05,878 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:00:05,878 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 16:00:05,896 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:00:05,897 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:00:05,898 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:00:05,898 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:00:05,898 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:00:05,898 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:00:05,898 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:00:05,899 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:00:05,899 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:00:05,899 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:00:05,899 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:00:05,899 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:00:05,899 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:00:05,900 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:00:05,900 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:00:05,900 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:00:05,900 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:00:05,900 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:00:05,900 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:00:05,900 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:00:05,900 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:00:05,900 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 16:00:05,901 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 16:00:05,901 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 16:00:05,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:00:05,940 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:00:05,943 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:00:05,944 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:00:05,945 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:00:05,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,253 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGacdb200d8 [2018-04-10 16:00:06,392 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:00:06,392 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:00:06,392 INFO L168 CDTParser]: Scanning optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,398 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:00:06,399 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:00:06,399 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:00:06,399 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append ('append') in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,399 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeData ('freeData') in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,399 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____bswap_64 ('__bswap_64') in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,399 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,399 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____bswap_32 ('__bswap_32') in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,399 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data ('create_data') in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,399 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:00:06,400 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____int8_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,400 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__register_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,400 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____uint64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,400 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____fsword_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,400 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_once_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,400 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__off_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,400 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_attr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,400 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____nlink_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,400 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____socklen_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,401 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____sig_atomic_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,401 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__timer_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,401 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____ssize_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,401 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__fsfilcnt_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,401 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____mode_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,401 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__nlink_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,401 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__uint in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,401 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__int32_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,401 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____intptr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,401 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,402 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____blkcnt64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,402 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__gid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,402 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__dev_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,402 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_short in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,402 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____uid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,402 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__ssize_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,402 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__id_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,402 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__mode_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,402 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__fsid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,402 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__int64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,403 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____key_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,403 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____blkcnt_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,403 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_mutex_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,403 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____clock_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,403 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____u_int in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,403 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____useconds_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,403 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__time_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,403 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____u_short in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,403 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____loff_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,403 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__suseconds_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,404 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____syscall_slong_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,404 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____blksize_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,404 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__int8_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,404 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__daddr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,404 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____qaddr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,404 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____uint16_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,404 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____fsfilcnt64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,404 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____int64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,404 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_condattr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,404 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__ldiv_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,404 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__ino_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,405 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__ushort in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,405 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____rlim64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,405 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____time_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,405 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____uint8_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,405 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_quad_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,405 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_int64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,405 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__loff_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,405 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____daddr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,405 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____fsfilcnt_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,405 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_barrierattr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,406 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__sigset_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,406 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__blkcnt_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,406 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__ulong in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,406 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_char in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,406 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____u_long in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,406 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____int16_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,406 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_int32_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,406 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____dev_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,406 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____fsblkcnt_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,406 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__Data in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,407 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____off_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,407 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_key_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,407 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_rwlock_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,407 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__clock_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,407 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____fsid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,407 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__blksize_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,407 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_long in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,407 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____uint32_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,407 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____caddr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,407 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__fd_set in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,407 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_rwlockattr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,408 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____ino_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,408 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____ino64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,408 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____sigset_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,408 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__quad_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,408 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__caddr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,408 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____rlim_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,408 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_cond_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,408 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_spinlock_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,408 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_int in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,408 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_int16_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,408 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____int32_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,408 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__fd_mask in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,409 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__div_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,409 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__size_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,409 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_int8_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,409 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__uid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,409 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__key_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,409 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____pthread_slist_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,409 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____clockid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,409 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__clockid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,409 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____fd_mask in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,409 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__int16_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,409 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__lldiv_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,410 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____quad_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,410 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,410 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____gid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,410 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__wchar_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,410 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____u_char in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,410 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____u_quad_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,410 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____syscall_ulong_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,410 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____id_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,410 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_barrier_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,410 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_mutexattr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,410 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__fsblkcnt_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,410 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____timer_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,411 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____off64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,411 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____suseconds_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,411 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____fsblkcnt64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,411 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____pid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:06,425 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGacdb200d8 [2018-04-10 16:00:06,428 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:00:06,429 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:00:06,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:00:06,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:00:06,433 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:00:06,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:00:06" (1/1) ... [2018-04-10 16:00:06,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c28dfba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:00:06, skipping insertion in model container [2018-04-10 16:00:06,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:00:06" (1/1) ... [2018-04-10 16:00:06,445 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:00:06,468 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:00:06,589 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:00:06,629 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:00:06,634 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 120 non ball SCCs. Number of states in SCCs 120. [2018-04-10 16:00:06,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:00:06 WrapperNode [2018-04-10 16:00:06,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:00:06,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:00:06,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:00:06,677 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:00:06,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:00:06" (1/1) ... [2018-04-10 16:00:06,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:00:06" (1/1) ... [2018-04-10 16:00:06,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:00:06" (1/1) ... [2018-04-10 16:00:06,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:00:06" (1/1) ... [2018-04-10 16:00:06,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:00:06" (1/1) ... [2018-04-10 16:00:06,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:00:06" (1/1) ... [2018-04-10 16:00:06,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:00:06" (1/1) ... [2018-04-10 16:00:06,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:00:06,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:00:06,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:00:06,723 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:00:06,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:00:06" (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 16:00:06,809 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:00:06,809 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:00:06,809 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____bswap_32 [2018-04-10 16:00:06,810 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____bswap_64 [2018-04-10 16:00:06,810 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data [2018-04-10 16:00:06,810 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeData [2018-04-10 16:00:06,810 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append [2018-04-10 16:00:06,810 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:00:06,810 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 16:00:06,810 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 16:00:06,810 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 16:00:06,810 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 16:00:06,810 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 16:00:06,810 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 16:00:06,810 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 16:00:06,810 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 16:00:06,810 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 16:00:06,810 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 16:00:06,811 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 16:00:06,811 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 16:00:06,811 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 16:00:06,811 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 16:00:06,811 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 16:00:06,811 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 16:00:06,811 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 16:00:06,811 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____bswap_32 [2018-04-10 16:00:06,811 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____bswap_64 [2018-04-10 16:00:06,811 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 16:00:06,811 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 16:00:06,811 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 16:00:06,811 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 16:00:06,812 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 16:00:06,812 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 16:00:06,812 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 16:00:06,812 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 16:00:06,812 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 16:00:06,812 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 16:00:06,812 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 16:00:06,812 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 16:00:06,812 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 16:00:06,813 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 16:00:06,813 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 16:00:06,813 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 16:00:06,813 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 16:00:06,813 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 16:00:06,813 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 16:00:06,813 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 16:00:06,813 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 16:00:06,813 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 16:00:06,813 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 16:00:06,814 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 16:00:06,814 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 16:00:06,814 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 16:00:06,814 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 16:00:06,814 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 16:00:06,814 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 16:00:06,814 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 16:00:06,814 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 16:00:06,814 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 16:00:06,814 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 16:00:06,815 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 16:00:06,815 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 16:00:06,815 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 16:00:06,815 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 16:00:06,815 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 16:00:06,815 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 16:00:06,815 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 16:00:06,815 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 16:00:06,815 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 16:00:06,815 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 16:00:06,815 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 16:00:06,816 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 16:00:06,816 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 16:00:06,816 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 16:00:06,816 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 16:00:06,816 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 16:00:06,816 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 16:00:06,816 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 16:00:06,816 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 16:00:06,816 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 16:00:06,816 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 16:00:06,816 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 16:00:06,817 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 16:00:06,817 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 16:00:06,817 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 16:00:06,817 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 16:00:06,817 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 16:00:06,817 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 16:00:06,817 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 16:00:06,817 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 16:00:06,817 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 16:00:06,817 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 16:00:06,818 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 16:00:06,818 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 16:00:06,818 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 16:00:06,818 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 16:00:06,818 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 16:00:06,818 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 16:00:06,818 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 16:00:06,818 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 16:00:06,818 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 16:00:06,818 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 16:00:06,819 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 16:00:06,819 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 16:00:06,819 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 16:00:06,819 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 16:00:06,819 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 16:00:06,819 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 16:00:06,819 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 16:00:06,819 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 16:00:06,819 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 16:00:06,819 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 16:00:06,819 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 16:00:06,820 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 16:00:06,820 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 16:00:06,820 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data [2018-04-10 16:00:06,820 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 16:00:06,820 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 16:00:06,820 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 16:00:06,820 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 16:00:06,820 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeData [2018-04-10 16:00:06,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 16:00:06,820 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append [2018-04-10 16:00:06,821 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:00:06,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:00:06,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:00:06,821 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 16:00:06,821 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 16:00:07,171 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:00:07,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:00:07 BoogieIcfgContainer [2018-04-10 16:00:07,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:00:07,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:00:07,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:00:07,174 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:00:07,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:00:06" (1/3) ... [2018-04-10 16:00:07,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2908c81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:00:07, skipping insertion in model container [2018-04-10 16:00:07,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:00:06" (2/3) ... [2018-04-10 16:00:07,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2908c81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:00:07, skipping insertion in model container [2018-04-10 16:00:07,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:00:07" (3/3) ... [2018-04-10 16:00:07,176 INFO L107 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_false-valid-memtrack.i [2018-04-10 16:00:07,181 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:00:07,187 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-04-10 16:00:07,210 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:00:07,211 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:00:07,211 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:00:07,211 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 16:00:07,211 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 16:00:07,211 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:00:07,211 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:00:07,211 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:00:07,211 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:00:07,212 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:00:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-04-10 16:00:07,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-10 16:00:07,227 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:07,228 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:07,228 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:07,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1118692906, now seen corresponding path program 1 times [2018-04-10 16:00:07,233 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:07,234 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:07,263 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:07,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:07,263 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:07,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:07,321 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 16:00:07,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:07,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 16:00:07,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:00:07,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:00:07,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:00:07,332 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2018-04-10 16:00:07,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:07,451 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-04-10 16:00:07,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:00:07,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-10 16:00:07,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:07,459 INFO L225 Difference]: With dead ends: 129 [2018-04-10 16:00:07,459 INFO L226 Difference]: Without dead ends: 126 [2018-04-10 16:00:07,460 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 16:00:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-10 16:00:07,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2018-04-10 16:00:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-10 16:00:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-04-10 16:00:07,494 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 7 [2018-04-10 16:00:07,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:07,494 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-04-10 16:00:07,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:00:07,494 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-04-10 16:00:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-10 16:00:07,495 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:07,495 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:07,495 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:07,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1118692905, now seen corresponding path program 1 times [2018-04-10 16:00:07,495 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:07,495 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:07,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:07,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:07,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:07,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:00:07,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:07,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 16:00:07,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:00:07,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:00:07,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:00:07,538 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 3 states. [2018-04-10 16:00:07,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:07,610 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-04-10 16:00:07,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:00:07,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-10 16:00:07,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:07,612 INFO L225 Difference]: With dead ends: 124 [2018-04-10 16:00:07,612 INFO L226 Difference]: Without dead ends: 124 [2018-04-10 16:00:07,613 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 16:00:07,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-10 16:00:07,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-04-10 16:00:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-10 16:00:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-04-10 16:00:07,620 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 7 [2018-04-10 16:00:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:07,620 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-04-10 16:00:07,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:00:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-04-10 16:00:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-10 16:00:07,621 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:07,621 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:07,621 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:07,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1889111161, now seen corresponding path program 1 times [2018-04-10 16:00:07,622 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:07,622 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:07,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:07,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:07,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:07,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:07,644 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:07,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:07,644 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:07,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:07,678 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:07,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:07,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:07,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:07,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:00:07,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:07,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:07,721 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 16:00:07,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:07,726 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 16:00:07,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-10 16:00:07,739 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 16:00:07,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:07,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:00:07,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:00:07,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:00:07,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:00:07,740 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 6 states. [2018-04-10 16:00:07,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:07,952 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-04-10 16:00:07,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:00:07,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-04-10 16:00:07,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:07,954 INFO L225 Difference]: With dead ends: 135 [2018-04-10 16:00:07,954 INFO L226 Difference]: Without dead ends: 135 [2018-04-10 16:00:07,954 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:00:07,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-10 16:00:07,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2018-04-10 16:00:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-10 16:00:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-04-10 16:00:07,960 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 14 [2018-04-10 16:00:07,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:07,960 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-04-10 16:00:07,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:00:07,961 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-04-10 16:00:07,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-10 16:00:07,961 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:07,961 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:07,961 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:07,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1889111162, now seen corresponding path program 1 times [2018-04-10 16:00:07,962 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:07,962 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:07,962 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:07,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:07,963 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:07,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:07,978 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:07,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:07,979 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:07,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:08,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:08,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:08,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:08,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 16:00:08,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:08,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:08,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:00:08,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:08,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:08,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, 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 16:00:08,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:08,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:08,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:08,070 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 16:00:08,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:08,074 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 16:00:08,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-10 16:00:08,082 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 16:00:08,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:08,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:00:08,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:00:08,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:00:08,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:00:08,084 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 6 states. [2018-04-10 16:00:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:08,283 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-04-10 16:00:08,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:00:08,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-04-10 16:00:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:08,285 INFO L225 Difference]: With dead ends: 133 [2018-04-10 16:00:08,285 INFO L226 Difference]: Without dead ends: 133 [2018-04-10 16:00:08,285 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 16:00:08,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-10 16:00:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2018-04-10 16:00:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-10 16:00:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-04-10 16:00:08,292 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 14 [2018-04-10 16:00:08,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:08,292 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-04-10 16:00:08,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:00:08,292 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-04-10 16:00:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 16:00:08,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:08,293 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:08,293 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:08,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1567096148, now seen corresponding path program 1 times [2018-04-10 16:00:08,293 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:08,293 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:08,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:08,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:08,295 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:08,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:08,323 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 16:00:08,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:08,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:00:08,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:00:08,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:00:08,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:00:08,324 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 4 states. [2018-04-10 16:00:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:08,386 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-04-10 16:00:08,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:00:08,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-10 16:00:08,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:08,387 INFO L225 Difference]: With dead ends: 127 [2018-04-10 16:00:08,387 INFO L226 Difference]: Without dead ends: 127 [2018-04-10 16:00:08,387 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 16:00:08,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-10 16:00:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-04-10 16:00:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-10 16:00:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2018-04-10 16:00:08,391 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 15 [2018-04-10 16:00:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:08,391 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2018-04-10 16:00:08,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:00:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2018-04-10 16:00:08,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 16:00:08,392 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:08,392 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:08,392 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:08,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1567096147, now seen corresponding path program 1 times [2018-04-10 16:00:08,392 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:08,393 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:08,393 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:08,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:08,393 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:08,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:08,425 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 16:00:08,426 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:08,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:00:08,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:00:08,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:00:08,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:00:08,426 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 4 states. [2018-04-10 16:00:08,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:08,480 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-04-10 16:00:08,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:00:08,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-10 16:00:08,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:08,481 INFO L225 Difference]: With dead ends: 126 [2018-04-10 16:00:08,481 INFO L226 Difference]: Without dead ends: 126 [2018-04-10 16:00:08,482 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 16:00:08,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-10 16:00:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-10 16:00:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-10 16:00:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-04-10 16:00:08,486 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 15 [2018-04-10 16:00:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:08,486 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-04-10 16:00:08,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:00:08,487 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-04-10 16:00:08,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:00:08,487 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:08,487 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 16:00:08,487 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:08,488 INFO L82 PathProgramCache]: Analyzing trace with hash -262877075, now seen corresponding path program 1 times [2018-04-10 16:00:08,488 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:08,488 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:08,488 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:08,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:08,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:08,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:08,529 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 16:00:08,530 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:08,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:00:08,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:00:08,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:00:08,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:00:08,530 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 5 states. [2018-04-10 16:00:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:08,641 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2018-04-10 16:00:08,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:00:08,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-10 16:00:08,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:08,642 INFO L225 Difference]: With dead ends: 143 [2018-04-10 16:00:08,642 INFO L226 Difference]: Without dead ends: 143 [2018-04-10 16:00:08,642 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 16:00:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-10 16:00:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 129. [2018-04-10 16:00:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-10 16:00:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2018-04-10 16:00:08,646 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 22 [2018-04-10 16:00:08,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:08,647 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2018-04-10 16:00:08,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:00:08,647 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2018-04-10 16:00:08,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:00:08,647 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:08,647 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 16:00:08,647 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:08,648 INFO L82 PathProgramCache]: Analyzing trace with hash -262877074, now seen corresponding path program 1 times [2018-04-10 16:00:08,648 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:08,648 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:08,648 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:08,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:08,648 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:08,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:08,683 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 16:00:08,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:08,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:00:08,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:00:08,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:00:08,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:00:08,684 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand 5 states. [2018-04-10 16:00:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:08,786 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-04-10 16:00:08,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:00:08,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-10 16:00:08,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:08,787 INFO L225 Difference]: With dead ends: 135 [2018-04-10 16:00:08,787 INFO L226 Difference]: Without dead ends: 135 [2018-04-10 16:00:08,787 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 16:00:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-10 16:00:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 129. [2018-04-10 16:00:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-10 16:00:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-04-10 16:00:08,791 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 22 [2018-04-10 16:00:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:08,791 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-04-10 16:00:08,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:00:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-04-10 16:00:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-10 16:00:08,792 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:08,792 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] [2018-04-10 16:00:08,792 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:08,792 INFO L82 PathProgramCache]: Analyzing trace with hash 440344442, now seen corresponding path program 1 times [2018-04-10 16:00:08,793 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:08,793 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:08,793 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:08,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:08,793 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:08,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:08,834 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 16:00:08,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:08,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:00:08,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:00:08,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:00:08,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:00:08,834 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 4 states. [2018-04-10 16:00:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:08,906 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2018-04-10 16:00:08,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:00:08,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-10 16:00:08,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:08,907 INFO L225 Difference]: With dead ends: 134 [2018-04-10 16:00:08,907 INFO L226 Difference]: Without dead ends: 134 [2018-04-10 16:00:08,907 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 16:00:08,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-10 16:00:08,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2018-04-10 16:00:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-10 16:00:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2018-04-10 16:00:08,909 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 23 [2018-04-10 16:00:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:08,909 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2018-04-10 16:00:08,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:00:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2018-04-10 16:00:08,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-10 16:00:08,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:08,909 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] [2018-04-10 16:00:08,909 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:08,910 INFO L82 PathProgramCache]: Analyzing trace with hash 440344441, now seen corresponding path program 1 times [2018-04-10 16:00:08,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:08,910 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:08,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:08,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:08,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:08,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:08,952 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 16:00:08,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:08,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:00:08,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:00:08,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:00:08,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:00:08,953 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand 4 states. [2018-04-10 16:00:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:09,033 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-04-10 16:00:09,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:00:09,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-10 16:00:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:09,034 INFO L225 Difference]: With dead ends: 126 [2018-04-10 16:00:09,035 INFO L226 Difference]: Without dead ends: 126 [2018-04-10 16:00:09,035 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 16:00:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-10 16:00:09,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-10 16:00:09,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-10 16:00:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-04-10 16:00:09,038 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 23 [2018-04-10 16:00:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:09,038 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-04-10 16:00:09,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:00:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-04-10 16:00:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-10 16:00:09,039 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:09,039 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:09,039 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:09,039 INFO L82 PathProgramCache]: Analyzing trace with hash 778201806, now seen corresponding path program 1 times [2018-04-10 16:00:09,039 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:09,040 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:09,040 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:09,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:09,040 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:09,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:09,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:00:09,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:09,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:00:09,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:00:09,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:00:09,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:00:09,071 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 4 states. [2018-04-10 16:00:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:09,143 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-04-10 16:00:09,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:00:09,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-04-10 16:00:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:09,144 INFO L225 Difference]: With dead ends: 136 [2018-04-10 16:00:09,144 INFO L226 Difference]: Without dead ends: 136 [2018-04-10 16:00:09,144 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:00:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-10 16:00:09,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2018-04-10 16:00:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-10 16:00:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-04-10 16:00:09,148 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 24 [2018-04-10 16:00:09,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:09,153 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-04-10 16:00:09,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:00:09,153 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-04-10 16:00:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-10 16:00:09,154 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:09,154 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:09,154 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:09,154 INFO L82 PathProgramCache]: Analyzing trace with hash 778201807, now seen corresponding path program 1 times [2018-04-10 16:00:09,154 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:09,154 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:09,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:09,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:09,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:09,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:09,205 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 16:00:09,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:09,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 16:00:09,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:00:09,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:00:09,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:00:09,206 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 7 states. [2018-04-10 16:00:09,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:09,332 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-04-10 16:00:09,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:00:09,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-04-10 16:00:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:09,333 INFO L225 Difference]: With dead ends: 128 [2018-04-10 16:00:09,333 INFO L226 Difference]: Without dead ends: 128 [2018-04-10 16:00:09,333 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:00:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-10 16:00:09,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-04-10 16:00:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-10 16:00:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-04-10 16:00:09,336 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 24 [2018-04-10 16:00:09,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:09,336 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-04-10 16:00:09,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:00:09,336 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-04-10 16:00:09,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-10 16:00:09,336 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:09,336 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:09,337 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:09,337 INFO L82 PathProgramCache]: Analyzing trace with hash 765747116, now seen corresponding path program 1 times [2018-04-10 16:00:09,337 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:09,337 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:09,338 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:09,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:09,338 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:09,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:09,349 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:09,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:09,349 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:09,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:09,373 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:09,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:09,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:09,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:09,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:09,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:09,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:00:09,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:09,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:09,402 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 16:00:09,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:09,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:09,409 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 16:00:09,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:09,416 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 16:00:09,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-10 16:00:09,423 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 16:00:09,424 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:09,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:00:09,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:00:09,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:00:09,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:00:09,424 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 5 states. [2018-04-10 16:00:09,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:09,556 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-04-10 16:00:09,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:00:09,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-04-10 16:00:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:09,557 INFO L225 Difference]: With dead ends: 128 [2018-04-10 16:00:09,557 INFO L226 Difference]: Without dead ends: 128 [2018-04-10 16:00:09,557 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 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 16:00:09,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-10 16:00:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2018-04-10 16:00:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-10 16:00:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-04-10 16:00:09,561 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 24 [2018-04-10 16:00:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:09,561 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-04-10 16:00:09,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:00:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-04-10 16:00:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 16:00:09,562 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:09,562 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] [2018-04-10 16:00:09,562 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:09,562 INFO L82 PathProgramCache]: Analyzing trace with hash -103829771, now seen corresponding path program 1 times [2018-04-10 16:00:09,562 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:09,562 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:09,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:09,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:09,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:09,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:09,576 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:09,576 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:09,576 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:09,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:09,592 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:09,603 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc3.base| Int)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc3.base| 1))) is different from true [2018-04-10 16:00:09,613 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 16:00:09,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:09,617 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 16:00:09,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-10 16:00:09,620 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 16:00:09,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:09,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:00:09,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:00:09,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:00:09,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-04-10 16:00:09,622 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 5 states. [2018-04-10 16:00:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:09,708 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-04-10 16:00:09,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:00:09,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-10 16:00:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:09,709 INFO L225 Difference]: With dead ends: 137 [2018-04-10 16:00:09,709 INFO L226 Difference]: Without dead ends: 137 [2018-04-10 16:00:09,710 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-04-10 16:00:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-10 16:00:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2018-04-10 16:00:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-10 16:00:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2018-04-10 16:00:09,713 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 29 [2018-04-10 16:00:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:09,714 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2018-04-10 16:00:09,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:00:09,714 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2018-04-10 16:00:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 16:00:09,714 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:09,714 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] [2018-04-10 16:00:09,715 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:09,715 INFO L82 PathProgramCache]: Analyzing trace with hash -103829770, now seen corresponding path program 1 times [2018-04-10 16:00:09,715 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:09,715 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:09,716 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:09,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:09,716 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:09,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:09,728 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:09,728 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:09,728 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:09,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:09,744 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:09,766 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc3.base| Int)) (= (store |c_old(#length)| |__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc3.base| 8) |c_#length|)) is different from true [2018-04-10 16:00:09,785 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 14 treesize of output 20 [2018-04-10 16:00:09,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:00:09,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:00:09,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-04-10 16:00:09,812 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 16:00:09,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:09,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:00:09,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:00:09,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:00:09,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=29, Unknown=1, NotChecked=10, Total=56 [2018-04-10 16:00:09,813 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand 8 states. [2018-04-10 16:00:09,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:09,960 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-04-10 16:00:09,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:00:09,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-04-10 16:00:09,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:09,961 INFO L225 Difference]: With dead ends: 137 [2018-04-10 16:00:09,961 INFO L226 Difference]: Without dead ends: 137 [2018-04-10 16:00:09,961 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=49, Unknown=1, NotChecked=14, Total=90 [2018-04-10 16:00:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-10 16:00:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2018-04-10 16:00:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-10 16:00:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-04-10 16:00:09,965 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 29 [2018-04-10 16:00:09,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:09,965 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-04-10 16:00:09,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:00:09,965 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-04-10 16:00:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 16:00:09,966 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:09,966 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:09,966 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:09,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1741287252, now seen corresponding path program 1 times [2018-04-10 16:00:09,967 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:09,967 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:09,967 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:09,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:09,968 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:09,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:00:09,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:09,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:00:09,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:00:09,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:00:09,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:00:09,999 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 5 states. [2018-04-10 16:00:10,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:10,095 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-04-10 16:00:10,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:00:10,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-10 16:00:10,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:10,096 INFO L225 Difference]: With dead ends: 127 [2018-04-10 16:00:10,096 INFO L226 Difference]: Without dead ends: 127 [2018-04-10 16:00:10,097 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 16:00:10,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-10 16:00:10,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-04-10 16:00:10,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-10 16:00:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-04-10 16:00:10,099 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 30 [2018-04-10 16:00:10,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:10,100 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-04-10 16:00:10,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:00:10,100 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-04-10 16:00:10,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 16:00:10,100 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:10,100 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:10,100 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:10,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1741287253, now seen corresponding path program 1 times [2018-04-10 16:00:10,100 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:10,101 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:10,101 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:10,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:10,101 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:10,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:10,177 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 16:00:10,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:10,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:00:10,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:00:10,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:00:10,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:00:10,179 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 6 states. [2018-04-10 16:00:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:10,302 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2018-04-10 16:00:10,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:00:10,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-10 16:00:10,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:10,304 INFO L225 Difference]: With dead ends: 132 [2018-04-10 16:00:10,304 INFO L226 Difference]: Without dead ends: 132 [2018-04-10 16:00:10,304 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 16:00:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-10 16:00:10,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2018-04-10 16:00:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-10 16:00:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2018-04-10 16:00:10,307 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 30 [2018-04-10 16:00:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:10,307 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2018-04-10 16:00:10,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:00:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2018-04-10 16:00:10,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 16:00:10,308 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:10,308 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:10,308 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:10,308 INFO L82 PathProgramCache]: Analyzing trace with hash -565817711, now seen corresponding path program 1 times [2018-04-10 16:00:10,308 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:10,308 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:10,309 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:10,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:10,309 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:10,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:10,344 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 16:00:10,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:10,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:00:10,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:00:10,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:00:10,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:00:10,345 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 5 states. [2018-04-10 16:00:10,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:10,451 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-04-10 16:00:10,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:00:10,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-10 16:00:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:10,452 INFO L225 Difference]: With dead ends: 124 [2018-04-10 16:00:10,452 INFO L226 Difference]: Without dead ends: 124 [2018-04-10 16:00:10,452 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 16:00:10,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-10 16:00:10,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-04-10 16:00:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-10 16:00:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-04-10 16:00:10,456 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 30 [2018-04-10 16:00:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:10,456 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-04-10 16:00:10,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:00:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-04-10 16:00:10,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 16:00:10,456 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:10,457 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:10,457 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:10,457 INFO L82 PathProgramCache]: Analyzing trace with hash -565817710, now seen corresponding path program 1 times [2018-04-10 16:00:10,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:10,457 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:10,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:10,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:10,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:10,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:10,532 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 16:00:10,532 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:10,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:00:10,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:00:10,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:00:10,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:00:10,533 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 6 states. [2018-04-10 16:00:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:10,666 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-04-10 16:00:10,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:00:10,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-10 16:00:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:10,667 INFO L225 Difference]: With dead ends: 131 [2018-04-10 16:00:10,667 INFO L226 Difference]: Without dead ends: 131 [2018-04-10 16:00:10,668 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 16:00:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-10 16:00:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-04-10 16:00:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-10 16:00:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-04-10 16:00:10,687 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 30 [2018-04-10 16:00:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:10,688 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-04-10 16:00:10,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:00:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-04-10 16:00:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:00:10,688 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:10,688 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:10,688 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:10,689 INFO L82 PathProgramCache]: Analyzing trace with hash -996161706, now seen corresponding path program 1 times [2018-04-10 16:00:10,689 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:10,689 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:10,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:10,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:10,690 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:10,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:10,698 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:10,699 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:10,699 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:10,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:10,716 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:10,727 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc3.base| Int)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc3.base| 1))) is different from true [2018-04-10 16:00:10,735 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 16:00:10,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:10,739 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 16:00:10,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-10 16:00:10,742 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 16:00:10,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:10,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:00:10,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:00:10,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:00:10,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-04-10 16:00:10,743 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 5 states. [2018-04-10 16:00:10,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:10,806 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-04-10 16:00:10,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:00:10,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-10 16:00:10,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:10,807 INFO L225 Difference]: With dead ends: 139 [2018-04-10 16:00:10,807 INFO L226 Difference]: Without dead ends: 139 [2018-04-10 16:00:10,807 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-04-10 16:00:10,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-10 16:00:10,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2018-04-10 16:00:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-10 16:00:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-04-10 16:00:10,809 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 31 [2018-04-10 16:00:10,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:10,809 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-04-10 16:00:10,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:00:10,809 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-04-10 16:00:10,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:00:10,809 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:10,809 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:10,810 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:10,810 INFO L82 PathProgramCache]: Analyzing trace with hash -996161705, now seen corresponding path program 1 times [2018-04-10 16:00:10,810 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:10,810 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:10,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:10,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:10,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:10,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:10,821 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:10,821 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:10,821 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:10,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:10,835 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:10,852 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc3.base| Int)) (and (= (store |c_old(#length)| |__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc3.base| 8) |c_#length|) (<= (select |c_old(#valid)| |__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc3.base|) 0))) is different from true [2018-04-10 16:00:10,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:10,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-10 16:00:10,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:10,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:10,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:10,875 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 16:00:10,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:10,880 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 16:00:10,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-10 16:00:10,889 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 16:00:10,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:10,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:00:10,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:00:10,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:00:10,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-04-10 16:00:10,889 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 6 states. [2018-04-10 16:00:11,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:11,016 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-04-10 16:00:11,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:00:11,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-10 16:00:11,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:11,017 INFO L225 Difference]: With dead ends: 140 [2018-04-10 16:00:11,017 INFO L226 Difference]: Without dead ends: 140 [2018-04-10 16:00:11,017 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2018-04-10 16:00:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-10 16:00:11,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 126. [2018-04-10 16:00:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-10 16:00:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-04-10 16:00:11,021 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 31 [2018-04-10 16:00:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:11,021 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-04-10 16:00:11,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:00:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-04-10 16:00:11,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-10 16:00:11,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:11,022 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:11,022 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:11,022 INFO L82 PathProgramCache]: Analyzing trace with hash 73575908, now seen corresponding path program 1 times [2018-04-10 16:00:11,022 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:11,022 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:11,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:11,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:11,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:11,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:11,078 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 16:00:11,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:11,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 16:00:11,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:00:11,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:00:11,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:00:11,079 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 7 states. [2018-04-10 16:00:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:11,255 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-04-10 16:00:11,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:00:11,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-04-10 16:00:11,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:11,259 INFO L225 Difference]: With dead ends: 141 [2018-04-10 16:00:11,259 INFO L226 Difference]: Without dead ends: 141 [2018-04-10 16:00:11,260 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 16:00:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-10 16:00:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2018-04-10 16:00:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-10 16:00:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2018-04-10 16:00:11,263 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 33 [2018-04-10 16:00:11,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:11,263 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2018-04-10 16:00:11,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:00:11,263 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2018-04-10 16:00:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-10 16:00:11,264 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:11,264 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:11,264 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:11,264 INFO L82 PathProgramCache]: Analyzing trace with hash 73575909, now seen corresponding path program 1 times [2018-04-10 16:00:11,264 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:11,264 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:11,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:11,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:11,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:11,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:11,346 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 16:00:11,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:11,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:00:11,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:00:11,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:00:11,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:00:11,347 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand 9 states. [2018-04-10 16:00:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:11,665 INFO L93 Difference]: Finished difference Result 178 states and 195 transitions. [2018-04-10 16:00:11,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 16:00:11,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-10 16:00:11,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:11,666 INFO L225 Difference]: With dead ends: 178 [2018-04-10 16:00:11,666 INFO L226 Difference]: Without dead ends: 178 [2018-04-10 16:00:11,666 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:00:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-10 16:00:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 149. [2018-04-10 16:00:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-10 16:00:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2018-04-10 16:00:11,670 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 33 [2018-04-10 16:00:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:11,671 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2018-04-10 16:00:11,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:00:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2018-04-10 16:00:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-10 16:00:11,671 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:11,672 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:11,672 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:11,672 INFO L82 PathProgramCache]: Analyzing trace with hash -550148662, now seen corresponding path program 1 times [2018-04-10 16:00:11,672 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:11,672 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:11,673 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:11,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:11,673 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:11,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:11,684 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:11,684 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:11,684 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:11,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:11,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:11,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:11,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:11,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:11,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:11,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:11,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:00:11,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:11,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:11,768 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 16:00:11,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:11,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:11,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:11,782 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 16:00:11,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:11,790 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 16:00:11,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-04-10 16:00:11,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:11,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:11,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:11,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:11,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 36 [2018-04-10 16:00:11,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:11,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:11,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:11,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:11,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:11,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-10 16:00:11,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:11,853 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 16:00:11,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:23 [2018-04-10 16:00:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:00:11,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:00:11,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-10 16:00:11,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:00:11,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:00:11,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=54, Unknown=2, NotChecked=0, Total=72 [2018-04-10 16:00:11,868 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand 9 states. [2018-04-10 16:00:12,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:12,308 INFO L93 Difference]: Finished difference Result 205 states and 230 transitions. [2018-04-10 16:00:12,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:00:12,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-04-10 16:00:12,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:12,310 INFO L225 Difference]: With dead ends: 205 [2018-04-10 16:00:12,310 INFO L226 Difference]: Without dead ends: 205 [2018-04-10 16:00:12,310 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=116, Unknown=2, NotChecked=0, Total=156 [2018-04-10 16:00:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-10 16:00:12,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 186. [2018-04-10 16:00:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-10 16:00:12,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 213 transitions. [2018-04-10 16:00:12,316 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 213 transitions. Word has length 34 [2018-04-10 16:00:12,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:12,316 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 213 transitions. [2018-04-10 16:00:12,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:00:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 213 transitions. [2018-04-10 16:00:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-10 16:00:12,317 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:12,317 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:12,317 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:12,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1986047201, now seen corresponding path program 1 times [2018-04-10 16:00:12,317 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:12,318 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:12,318 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:12,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:12,318 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:12,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:12,374 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 16:00:12,374 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:12,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:00:12,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:00:12,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:00:12,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:00:12,375 INFO L87 Difference]: Start difference. First operand 186 states and 213 transitions. Second operand 8 states. [2018-04-10 16:00:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:12,522 INFO L93 Difference]: Finished difference Result 205 states and 229 transitions. [2018-04-10 16:00:12,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:00:12,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-04-10 16:00:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:12,524 INFO L225 Difference]: With dead ends: 205 [2018-04-10 16:00:12,524 INFO L226 Difference]: Without dead ends: 205 [2018-04-10 16:00:12,524 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 16:00:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-10 16:00:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 186. [2018-04-10 16:00:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-10 16:00:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 209 transitions. [2018-04-10 16:00:12,529 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 209 transitions. Word has length 35 [2018-04-10 16:00:12,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:12,529 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 209 transitions. [2018-04-10 16:00:12,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:00:12,530 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 209 transitions. [2018-04-10 16:00:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-10 16:00:12,530 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:12,530 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:12,530 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:12,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1466613884, now seen corresponding path program 1 times [2018-04-10 16:00:12,531 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:12,531 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:12,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:12,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:12,532 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:12,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:12,640 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 16:00:12,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:12,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 16:00:12,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:00:12,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:00:12,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:00:12,641 INFO L87 Difference]: Start difference. First operand 186 states and 209 transitions. Second operand 10 states. [2018-04-10 16:00:12,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:12,889 INFO L93 Difference]: Finished difference Result 224 states and 256 transitions. [2018-04-10 16:00:12,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:00:12,889 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-04-10 16:00:12,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:12,890 INFO L225 Difference]: With dead ends: 224 [2018-04-10 16:00:12,890 INFO L226 Difference]: Without dead ends: 224 [2018-04-10 16:00:12,890 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:00:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-10 16:00:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 192. [2018-04-10 16:00:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-10 16:00:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 217 transitions. [2018-04-10 16:00:12,894 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 217 transitions. Word has length 36 [2018-04-10 16:00:12,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:12,894 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 217 transitions. [2018-04-10 16:00:12,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:00:12,894 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 217 transitions. [2018-04-10 16:00:12,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-10 16:00:12,894 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:12,894 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:12,894 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:12,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1466613883, now seen corresponding path program 1 times [2018-04-10 16:00:12,895 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:12,895 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:12,895 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:12,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:12,895 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:12,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:12,912 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 16:00:12,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:12,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:00:12,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:00:12,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:00:12,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:00:12,913 INFO L87 Difference]: Start difference. First operand 192 states and 217 transitions. Second operand 5 states. [2018-04-10 16:00:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:13,016 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2018-04-10 16:00:13,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:00:13,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-04-10 16:00:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:13,017 INFO L225 Difference]: With dead ends: 191 [2018-04-10 16:00:13,017 INFO L226 Difference]: Without dead ends: 191 [2018-04-10 16:00:13,017 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 16:00:13,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-04-10 16:00:13,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-04-10 16:00:13,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-10 16:00:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2018-04-10 16:00:13,020 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 36 [2018-04-10 16:00:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:13,021 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2018-04-10 16:00:13,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:00:13,021 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2018-04-10 16:00:13,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 16:00:13,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:13,021 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] [2018-04-10 16:00:13,021 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:13,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1151086149, now seen corresponding path program 1 times [2018-04-10 16:00:13,021 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:13,021 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:13,022 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:13,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:13,022 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:13,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:13,146 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 16:00:13,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:13,147 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:13,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:13,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:13,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:00:13,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:00:13,201 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 16:00:13,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:13,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,213 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 16:00:13,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:13,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,217 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,223 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 16:00:13,223 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:21 [2018-04-10 16:00:13,309 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 16:00:13,312 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 16:00:13,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,323 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 16:00:13,325 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 16:00:13,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,332 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 16:00:13,332 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:19 [2018-04-10 16:00:13,345 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 16:00:13,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:00:13,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-04-10 16:00:13,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 16:00:13,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 16:00:13,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:00:13,356 INFO L87 Difference]: Start difference. First operand 191 states and 213 transitions. Second operand 16 states. [2018-04-10 16:00:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:13,603 INFO L93 Difference]: Finished difference Result 201 states and 223 transitions. [2018-04-10 16:00:13,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:00:13,603 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-04-10 16:00:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:13,604 INFO L225 Difference]: With dead ends: 201 [2018-04-10 16:00:13,604 INFO L226 Difference]: Without dead ends: 201 [2018-04-10 16:00:13,604 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2018-04-10 16:00:13,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-10 16:00:13,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-04-10 16:00:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-10 16:00:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 223 transitions. [2018-04-10 16:00:13,607 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 223 transitions. Word has length 37 [2018-04-10 16:00:13,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:13,607 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 223 transitions. [2018-04-10 16:00:13,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 16:00:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2018-04-10 16:00:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-10 16:00:13,607 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:13,607 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:13,607 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:13,608 INFO L82 PathProgramCache]: Analyzing trace with hash 722626987, now seen corresponding path program 1 times [2018-04-10 16:00:13,608 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:13,608 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:13,608 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:13,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:13,608 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:13,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:13,619 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:13,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:13,619 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:13,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:13,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:13,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:00:13,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:00:13,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:13,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-10 16:00:13,748 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 16:00:13,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:24 [2018-04-10 16:00:13,771 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 16:00:13,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:13,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,783 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 16:00:13,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:13,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,796 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-10 16:00:13,836 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 16:00:13,840 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 20 treesize of output 19 [2018-04-10 16:00:13,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,858 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 16:00:13,859 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:00:13,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:00:13,898 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 16:00:13,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 16:00:13,901 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,912 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:00:13,927 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:54, output treesize:105 [2018-04-10 16:00:13,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:13,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:13,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2018-04-10 16:00:13,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:13,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:00:13,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:121, output treesize:62 [2018-04-10 16:00:14,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:14,063 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:14,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 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 16:00:14,067 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:14,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 16:00:14,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:14,077 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:14,077 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 29 treesize of output 26 [2018-04-10 16:00:14,078 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 16:00:14,084 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 16:00:14,099 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 16:00:14,100 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:14,101 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 16:00:14,101 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:14,106 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:14,106 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 11 treesize of output 10 [2018-04-10 16:00:14,107 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:14,109 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:14,115 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 16:00:14,115 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:94, output treesize:7 [2018-04-10 16:00:14,161 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 16:00:14,161 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:14,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-04-10 16:00:14,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 16:00:14,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 16:00:14,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=300, Unknown=2, NotChecked=0, Total=342 [2018-04-10 16:00:14,162 INFO L87 Difference]: Start difference. First operand 201 states and 223 transitions. Second operand 19 states. [2018-04-10 16:00:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:14,981 INFO L93 Difference]: Finished difference Result 254 states and 283 transitions. [2018-04-10 16:00:14,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 16:00:14,981 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-04-10 16:00:14,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:14,982 INFO L225 Difference]: With dead ends: 254 [2018-04-10 16:00:14,983 INFO L226 Difference]: Without dead ends: 254 [2018-04-10 16:00:14,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=1029, Unknown=5, NotChecked=0, Total=1190 [2018-04-10 16:00:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-04-10 16:00:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 228. [2018-04-10 16:00:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-10 16:00:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 257 transitions. [2018-04-10 16:00:14,990 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 257 transitions. Word has length 40 [2018-04-10 16:00:14,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:14,990 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 257 transitions. [2018-04-10 16:00:14,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 16:00:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 257 transitions. [2018-04-10 16:00:14,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-10 16:00:14,991 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:14,991 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:14,991 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:14,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1316022877, now seen corresponding path program 1 times [2018-04-10 16:00:14,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:14,992 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:14,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:14,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:14,993 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:15,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:15,006 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:15,006 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:15,006 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:15,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:15,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:15,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:15,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:15,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:15,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-10 16:00:15,123 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc3.base| Int)) (and (= (store |c_old(#length)| |__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc3.base| 8) |c_#length|) (= (select |c_old(#valid)| |__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc3.base|) 0))) is different from true [2018-04-10 16:00:15,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:15,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:15,133 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 16:00:15,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:15,142 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 16:00:15,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:15,150 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 16:00:15,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-04-10 16:00:15,170 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 16:00:15,173 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 16:00:15,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:15,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:15,191 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 16:00:15,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:00:15,194 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:15,195 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:15,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:00:15,206 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:43, output treesize:36 [2018-04-10 16:00:15,246 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 25 treesize of output 19 [2018-04-10 16:00:15,248 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:15,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-10 16:00:15,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:15,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:15,259 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 16:00:15,260 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:15,261 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 16:00:15,261 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:15,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:15,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:00:15,268 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:53, output treesize:18 [2018-04-10 16:00:15,281 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 16:00:15,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:15,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-10 16:00:15,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 16:00:15,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 16:00:15,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=123, Unknown=1, NotChecked=22, Total=182 [2018-04-10 16:00:15,281 INFO L87 Difference]: Start difference. First operand 228 states and 257 transitions. Second operand 14 states. [2018-04-10 16:00:15,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:15,825 INFO L93 Difference]: Finished difference Result 318 states and 367 transitions. [2018-04-10 16:00:15,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:00:15,826 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-04-10 16:00:15,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:15,827 INFO L225 Difference]: With dead ends: 318 [2018-04-10 16:00:15,827 INFO L226 Difference]: Without dead ends: 318 [2018-04-10 16:00:15,827 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=557, Unknown=1, NotChecked=50, Total=756 [2018-04-10 16:00:15,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-04-10 16:00:15,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 257. [2018-04-10 16:00:15,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-04-10 16:00:15,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 296 transitions. [2018-04-10 16:00:15,834 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 296 transitions. Word has length 40 [2018-04-10 16:00:15,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:15,834 INFO L459 AbstractCegarLoop]: Abstraction has 257 states and 296 transitions. [2018-04-10 16:00:15,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 16:00:15,834 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 296 transitions. [2018-04-10 16:00:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-10 16:00:15,835 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:15,835 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:15,835 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:15,835 INFO L82 PathProgramCache]: Analyzing trace with hash -688998318, now seen corresponding path program 1 times [2018-04-10 16:00:15,835 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:15,835 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:15,836 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:15,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:15,836 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:15,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:15,847 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:15,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:15,847 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:15,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:15,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:15,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:15,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:15,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:15,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:00:15,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:15,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:15,967 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 16:00:15,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:15,971 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 16:00:15,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-04-10 16:00:16,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:16,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:16,018 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 16:00:16,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:16,025 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 16:00:16,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:16,035 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 16:00:16,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-04-10 16:00:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:00:16,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:00:16,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-10 16:00:16,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 16:00:16,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 16:00:16,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=107, Unknown=2, NotChecked=0, Total=132 [2018-04-10 16:00:16,056 INFO L87 Difference]: Start difference. First operand 257 states and 296 transitions. Second operand 12 states. [2018-04-10 16:00:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:16,484 INFO L93 Difference]: Finished difference Result 279 states and 319 transitions. [2018-04-10 16:00:16,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:00:16,484 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-04-10 16:00:16,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:16,485 INFO L225 Difference]: With dead ends: 279 [2018-04-10 16:00:16,485 INFO L226 Difference]: Without dead ends: 279 [2018-04-10 16:00:16,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=240, Unknown=6, NotChecked=0, Total=306 [2018-04-10 16:00:16,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-10 16:00:16,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2018-04-10 16:00:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-10 16:00:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 264 transitions. [2018-04-10 16:00:16,491 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 264 transitions. Word has length 41 [2018-04-10 16:00:16,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:16,491 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 264 transitions. [2018-04-10 16:00:16,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 16:00:16,491 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 264 transitions. [2018-04-10 16:00:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-10 16:00:16,492 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:16,492 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:16,492 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:16,492 INFO L82 PathProgramCache]: Analyzing trace with hash 586362613, now seen corresponding path program 1 times [2018-04-10 16:00:16,492 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:16,493 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:16,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:16,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:16,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:16,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:00:16,549 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:16,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:00:16,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:00:16,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:00:16,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:00:16,550 INFO L87 Difference]: Start difference. First operand 230 states and 264 transitions. Second operand 8 states. [2018-04-10 16:00:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:16,712 INFO L93 Difference]: Finished difference Result 248 states and 282 transitions. [2018-04-10 16:00:16,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:00:16,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-04-10 16:00:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:16,714 INFO L225 Difference]: With dead ends: 248 [2018-04-10 16:00:16,714 INFO L226 Difference]: Without dead ends: 248 [2018-04-10 16:00:16,714 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-10 16:00:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-10 16:00:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 239. [2018-04-10 16:00:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-04-10 16:00:16,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 276 transitions. [2018-04-10 16:00:16,718 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 276 transitions. Word has length 44 [2018-04-10 16:00:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:16,718 INFO L459 AbstractCegarLoop]: Abstraction has 239 states and 276 transitions. [2018-04-10 16:00:16,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:00:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 276 transitions. [2018-04-10 16:00:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 16:00:16,719 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:16,719 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:16,719 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:16,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1176080644, now seen corresponding path program 1 times [2018-04-10 16:00:16,719 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:16,719 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:16,720 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:16,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:16,720 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:16,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:16,823 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 16:00:16,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:16,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 16:00:16,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:00:16,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:00:16,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:00:16,824 INFO L87 Difference]: Start difference. First operand 239 states and 276 transitions. Second operand 10 states. [2018-04-10 16:00:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:17,017 INFO L93 Difference]: Finished difference Result 247 states and 281 transitions. [2018-04-10 16:00:17,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:00:17,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-04-10 16:00:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:17,018 INFO L225 Difference]: With dead ends: 247 [2018-04-10 16:00:17,019 INFO L226 Difference]: Without dead ends: 247 [2018-04-10 16:00:17,019 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:00:17,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-10 16:00:17,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 222. [2018-04-10 16:00:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-10 16:00:17,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 256 transitions. [2018-04-10 16:00:17,022 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 256 transitions. Word has length 43 [2018-04-10 16:00:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:17,022 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 256 transitions. [2018-04-10 16:00:17,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:00:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 256 transitions. [2018-04-10 16:00:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-10 16:00:17,023 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:17,023 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:17,023 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:17,023 INFO L82 PathProgramCache]: Analyzing trace with hash 997371954, now seen corresponding path program 1 times [2018-04-10 16:00:17,023 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:17,023 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:17,024 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:17,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:17,024 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:17,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:17,056 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 16:00:17,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:17,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:00:17,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:00:17,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:00:17,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:00:17,057 INFO L87 Difference]: Start difference. First operand 222 states and 256 transitions. Second operand 6 states. [2018-04-10 16:00:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:17,171 INFO L93 Difference]: Finished difference Result 235 states and 268 transitions. [2018-04-10 16:00:17,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:00:17,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-04-10 16:00:17,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:17,172 INFO L225 Difference]: With dead ends: 235 [2018-04-10 16:00:17,172 INFO L226 Difference]: Without dead ends: 235 [2018-04-10 16:00:17,172 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:00:17,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-04-10 16:00:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 227. [2018-04-10 16:00:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-04-10 16:00:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 262 transitions. [2018-04-10 16:00:17,177 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 262 transitions. Word has length 45 [2018-04-10 16:00:17,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:17,177 INFO L459 AbstractCegarLoop]: Abstraction has 227 states and 262 transitions. [2018-04-10 16:00:17,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:00:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 262 transitions. [2018-04-10 16:00:17,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 16:00:17,178 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:17,178 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:17,178 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1923762637, now seen corresponding path program 1 times [2018-04-10 16:00:17,178 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:17,178 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:17,179 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:17,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:17,179 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:17,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:17,189 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:17,189 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:17,189 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:17,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:17,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:17,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:00:17,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:17,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:17,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:17,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:17,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-10 16:00:17,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:17,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:17,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, 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 16:00:17,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:17,377 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 16:00:17,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:48 [2018-04-10 16:00:17,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:00:17,423 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 16:00:17,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:17,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:17,445 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 16:00:17,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:63 [2018-04-10 16:00:17,487 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 16:00:17,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:17,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:17,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:17,517 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 42 treesize of output 50 [2018-04-10 16:00:17,524 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 43 treesize of output 42 [2018-04-10 16:00:17,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:17,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 48 [2018-04-10 16:00:17,560 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 16:00:17,576 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 16:00:17,603 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 16:00:17,603 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:79, output treesize:189 [2018-04-10 16:00:17,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:17,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:17,748 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 16:00:17,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:17,767 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 13 treesize of output 7 [2018-04-10 16:00:17,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:17,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:17,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:17,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-10 16:00:17,771 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:17,783 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 16:00:17,783 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:179, output treesize:69 [2018-04-10 16:00:17,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2018-04-10 16:00:17,817 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 49 treesize of output 39 [2018-04-10 16:00:17,817 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 16:00:17,825 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 16:00:17,841 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 16:00:17,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:63 [2018-04-10 16:00:17,873 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 58 treesize of output 39 [2018-04-10 16:00:17,875 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:17,875 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 21 treesize of output 15 [2018-04-10 16:00:17,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:17,882 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 20 treesize of output 14 [2018-04-10 16:00:17,883 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 16:00:17,888 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 16:00:17,896 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 16:00:17,896 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:70, output treesize:15 [2018-04-10 16:00:17,968 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 16:00:17,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:17,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-04-10 16:00:17,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 16:00:17,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 16:00:17,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=301, Unknown=4, NotChecked=0, Total=342 [2018-04-10 16:00:17,969 INFO L87 Difference]: Start difference. First operand 227 states and 262 transitions. Second operand 19 states. [2018-04-10 16:00:19,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:19,009 INFO L93 Difference]: Finished difference Result 273 states and 315 transitions. [2018-04-10 16:00:19,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 16:00:19,009 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-04-10 16:00:19,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:19,010 INFO L225 Difference]: With dead ends: 273 [2018-04-10 16:00:19,010 INFO L226 Difference]: Without dead ends: 273 [2018-04-10 16:00:19,010 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=669, Unknown=6, NotChecked=0, Total=756 [2018-04-10 16:00:19,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-10 16:00:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 247. [2018-04-10 16:00:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-04-10 16:00:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 289 transitions. [2018-04-10 16:00:19,015 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 289 transitions. Word has length 47 [2018-04-10 16:00:19,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:19,016 INFO L459 AbstractCegarLoop]: Abstraction has 247 states and 289 transitions. [2018-04-10 16:00:19,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 16:00:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 289 transitions. [2018-04-10 16:00:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 16:00:19,016 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:19,017 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:19,017 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:19,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1923762636, now seen corresponding path program 1 times [2018-04-10 16:00:19,017 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:19,017 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:19,018 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:19,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:19,018 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:19,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:19,032 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:19,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:19,032 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:19,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:19,091 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:19,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:19,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:00:19,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:00:19,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-04-10 16:00:19,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:19,215 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 16:00:19,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-04-10 16:00:19,268 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 16:00:19,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:19,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,286 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 16:00:19,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:00:19,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,300 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 16:00:19,301 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:51 [2018-04-10 16:00:19,348 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 16:00:19,352 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 18 [2018-04-10 16:00:19,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:19,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,391 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 33 treesize of output 43 [2018-04-10 16:00:19,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-10 16:00:19,396 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:19,428 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 29 treesize of output 39 [2018-04-10 16:00:19,429 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:00:19,450 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:00:19,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:00:19,467 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:64, output treesize:141 [2018-04-10 16:00:19,612 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 41 DAG size of output 41 [2018-04-10 16:00:19,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:19,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:19,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:19,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:19,645 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 16:00:19,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:140, output treesize:72 [2018-04-10 16:00:19,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:19,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:19,750 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 84 treesize of output 67 [2018-04-10 16:00:19,756 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2018-04-10 16:00:19,757 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 16:00:19,772 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:19,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 52 [2018-04-10 16:00:19,776 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:00:19,777 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:19,778 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 48 treesize of output 40 [2018-04-10 16:00:19,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:00:19,813 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 51 treesize of output 43 [2018-04-10 16:00:19,814 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 16:00:19,815 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,821 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:19,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 16:00:19,821 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,827 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,829 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 51 treesize of output 43 [2018-04-10 16:00:19,831 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 16:00:19,831 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,868 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:19,869 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 16:00:19,869 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,874 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:19,888 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 16:00:19,889 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:101, output treesize:37 [2018-04-10 16:00:19,961 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 16:00:19,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:19,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-04-10 16:00:19,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:00:19,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:00:19,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:00:19,962 INFO L87 Difference]: Start difference. First operand 247 states and 289 transitions. Second operand 21 states. [2018-04-10 16:00:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:21,052 INFO L93 Difference]: Finished difference Result 347 states and 404 transitions. [2018-04-10 16:00:21,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:00:21,052 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-04-10 16:00:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:21,053 INFO L225 Difference]: With dead ends: 347 [2018-04-10 16:00:21,053 INFO L226 Difference]: Without dead ends: 347 [2018-04-10 16:00:21,054 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=1071, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 16:00:21,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-04-10 16:00:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 287. [2018-04-10 16:00:21,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-04-10 16:00:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 340 transitions. [2018-04-10 16:00:21,058 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 340 transitions. Word has length 47 [2018-04-10 16:00:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:21,058 INFO L459 AbstractCegarLoop]: Abstraction has 287 states and 340 transitions. [2018-04-10 16:00:21,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:00:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 340 transitions. [2018-04-10 16:00:21,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-10 16:00:21,059 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:21,059 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:21,059 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:21,059 INFO L82 PathProgramCache]: Analyzing trace with hash 124262969, now seen corresponding path program 1 times [2018-04-10 16:00:21,059 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:21,059 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:21,060 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:21,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:21,060 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:21,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:21,068 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:21,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:21,069 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:21,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:21,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:21,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:21,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:21,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:21,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:00:21,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 16:00:21,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:00:21,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:21,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:21,174 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 16:00:21,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2018-04-10 16:00:21,176 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~pointerToList.offset Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base|) __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~pointerToList.offset))) (and (= |c_#valid| (store |c_old(#valid)| .cse0 1)) (<= (select |c_old(#valid)| .cse0) 0) (<= __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~pointerToList.offset |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.offset|) (<= 0 __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~pointerToList.offset)))) is different from true [2018-04-10 16:00:21,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:21,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:21,182 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 25 treesize of output 32 [2018-04-10 16:00:21,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:21,188 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 16:00:21,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2018-04-10 16:00:21,226 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 16:00:21,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:21,244 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 16:00:21,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-04-10 16:00:25,830 WARN L148 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 16 [2018-04-10 16:00:25,859 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 25 treesize of output 19 [2018-04-10 16:00:25,860 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:25,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-10 16:00:25,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:25,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:25,867 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 16:00:25,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-04-10 16:00:25,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:25,876 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 16:00:25,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:25,879 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 16:00:25,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-10 16:00:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:00:25,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:25,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-10 16:00:25,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 16:00:25,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 16:00:25,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=127, Unknown=3, NotChecked=22, Total=182 [2018-04-10 16:00:25,915 INFO L87 Difference]: Start difference. First operand 287 states and 340 transitions. Second operand 14 states. [2018-04-10 16:00:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:42,573 INFO L93 Difference]: Finished difference Result 372 states and 438 transitions. [2018-04-10 16:00:42,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:00:42,574 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-04-10 16:00:42,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:42,576 INFO L225 Difference]: With dead ends: 372 [2018-04-10 16:00:42,577 INFO L226 Difference]: Without dead ends: 372 [2018-04-10 16:00:42,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=63, Invalid=280, Unknown=3, NotChecked=34, Total=380 [2018-04-10 16:00:42,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-04-10 16:00:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 307. [2018-04-10 16:00:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-04-10 16:00:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 362 transitions. [2018-04-10 16:00:42,584 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 362 transitions. Word has length 48 [2018-04-10 16:00:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:42,584 INFO L459 AbstractCegarLoop]: Abstraction has 307 states and 362 transitions. [2018-04-10 16:00:42,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 16:00:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 362 transitions. [2018-04-10 16:00:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 16:00:42,585 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:42,585 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:42,585 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:42,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1230859131, now seen corresponding path program 1 times [2018-04-10 16:00:42,586 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:42,586 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:42,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:42,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:42,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:42,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:42,616 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 16:00:42,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:42,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:00:42,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:00:42,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:00:42,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:00:42,618 INFO L87 Difference]: Start difference. First operand 307 states and 362 transitions. Second operand 5 states. [2018-04-10 16:00:42,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:42,675 INFO L93 Difference]: Finished difference Result 318 states and 377 transitions. [2018-04-10 16:00:42,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:00:42,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-04-10 16:00:42,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:42,676 INFO L225 Difference]: With dead ends: 318 [2018-04-10 16:00:42,676 INFO L226 Difference]: Without dead ends: 318 [2018-04-10 16:00:42,676 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 16:00:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-04-10 16:00:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 306. [2018-04-10 16:00:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-04-10 16:00:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 360 transitions. [2018-04-10 16:00:42,681 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 360 transitions. Word has length 50 [2018-04-10 16:00:42,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:42,682 INFO L459 AbstractCegarLoop]: Abstraction has 306 states and 360 transitions. [2018-04-10 16:00:42,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:00:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 360 transitions. [2018-04-10 16:00:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-10 16:00:42,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:42,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, 1, 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 16:00:42,683 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:42,683 INFO L82 PathProgramCache]: Analyzing trace with hash -498072556, now seen corresponding path program 1 times [2018-04-10 16:00:42,683 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:42,683 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:42,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:42,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:42,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:42,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:42,714 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 16:00:42,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:42,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:00:42,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:00:42,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:00:42,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:00:42,715 INFO L87 Difference]: Start difference. First operand 306 states and 360 transitions. Second operand 5 states. [2018-04-10 16:00:42,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:42,777 INFO L93 Difference]: Finished difference Result 317 states and 375 transitions. [2018-04-10 16:00:42,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:00:42,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-04-10 16:00:42,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:42,778 INFO L225 Difference]: With dead ends: 317 [2018-04-10 16:00:42,779 INFO L226 Difference]: Without dead ends: 317 [2018-04-10 16:00:42,779 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 16:00:42,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-04-10 16:00:42,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2018-04-10 16:00:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-04-10 16:00:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 358 transitions. [2018-04-10 16:00:42,783 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 358 transitions. Word has length 51 [2018-04-10 16:00:42,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:42,783 INFO L459 AbstractCegarLoop]: Abstraction has 305 states and 358 transitions. [2018-04-10 16:00:42,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:00:42,784 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 358 transitions. [2018-04-10 16:00:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 16:00:42,784 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:42,784 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:42,784 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:42,785 INFO L82 PathProgramCache]: Analyzing trace with hash 459154013, now seen corresponding path program 1 times [2018-04-10 16:00:42,785 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:42,785 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:42,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:42,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:42,786 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:42,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:42,796 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:42,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:42,797 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:42,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:42,822 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:42,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:00:42,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:42,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:42,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:42,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:42,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:00:42,857 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 16:00:42,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:00:42,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:42,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:42,873 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 16:00:42,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 8 treesize of output 7 [2018-04-10 16:00:42,875 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:42,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:42,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:42,885 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-10 16:00:43,276 WARN L148 SmtUtils]: Spent 131ms on a formula simplification that was a NOOP. DAG size: 74 [2018-04-10 16:00:43,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,285 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 16:00:43,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:43,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,367 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 16:00:43,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:43,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,466 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 1 case distinctions, treesize of input 40 treesize of output 44 [2018-04-10 16:00:43,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-10 16:00:43,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 16:00:43,473 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:43,478 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:43,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,508 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 39 treesize of output 57 [2018-04-10 16:00:43,512 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 46 treesize of output 34 [2018-04-10 16:00:43,512 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:43,550 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:43,552 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 35 treesize of output 36 [2018-04-10 16:00:43,552 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:43,577 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:00:43,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:00:43,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2018-04-10 16:00:43,614 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-04-10 16:00:43,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 45 [2018-04-10 16:00:43,625 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-10 16:00:43,640 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:00:43,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,669 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 39 treesize of output 34 [2018-04-10 16:00:43,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,688 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 51 [2018-04-10 16:00:43,689 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 6 xjuncts. [2018-04-10 16:00:43,711 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:00:43,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,717 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 29 treesize of output 28 [2018-04-10 16:00:43,720 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 11 [2018-04-10 16:00:43,720 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:43,725 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:43,744 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:00:43,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,811 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 1 case distinctions, treesize of input 40 treesize of output 44 [2018-04-10 16:00:43,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-10 16:00:43,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 16:00:43,818 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:43,823 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:43,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,869 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 39 treesize of output 57 [2018-04-10 16:00:43,873 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 46 treesize of output 34 [2018-04-10 16:00:43,873 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:43,907 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:00:43,922 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:00:43,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2018-04-10 16:00:43,934 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-04-10 16:00:43,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 45 [2018-04-10 16:00:43,945 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-04-10 16:00:43,959 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:00:43,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:43,982 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 39 treesize of output 34 [2018-04-10 16:00:43,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:44,000 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 51 [2018-04-10 16:00:44,001 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 6 xjuncts. [2018-04-10 16:00:44,020 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:00:44,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:44,024 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 29 treesize of output 28 [2018-04-10 16:00:44,026 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 11 [2018-04-10 16:00:44,027 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:44,031 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:44,060 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:00:44,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 16 dim-0 vars, and 8 xjuncts. [2018-04-10 16:00:44,114 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 10 variables, input treesize:145, output treesize:539 [2018-04-10 16:00:44,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:44,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:44,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 81 [2018-04-10 16:00:44,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:00:44,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:44,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:44,334 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 99 treesize of output 89 [2018-04-10 16:00:44,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:44,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-10 16:00:44,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:188, output treesize:223 [2018-04-10 16:00:44,546 WARN L148 SmtUtils]: Spent 139ms on a formula simplification that was a NOOP. DAG size: 74 [2018-04-10 16:00:44,988 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:44,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:44,993 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 89 treesize of output 101 [2018-04-10 16:00:44,995 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 84 treesize of output 80 [2018-04-10 16:00:44,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:45,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:45,019 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:45,020 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 107 treesize of output 103 [2018-04-10 16:00:45,021 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:45,022 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 70 [2018-04-10 16:00:45,022 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 16:00:45,030 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:00:45,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:00:45,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:133, output treesize:80 [2018-04-10 16:00:45,161 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 46 treesize of output 38 [2018-04-10 16:00:45,163 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 10 [2018-04-10 16:00:45,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:45,169 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 16:00:45,169 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:45,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:45,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-04-10 16:00:45,189 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:45,190 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 16:00:45,190 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:45,196 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 15 treesize of output 3 [2018-04-10 16:00:45,196 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:45,197 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:45,204 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 16:00:45,204 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:91, output treesize:10 [2018-04-10 16:00:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:00:45,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:00:45,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-10 16:00:45,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 16:00:45,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 16:00:45,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-04-10 16:00:45,257 INFO L87 Difference]: Start difference. First operand 305 states and 358 transitions. Second operand 23 states. [2018-04-10 16:00:45,922 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 99 DAG size of output 69 [2018-04-10 16:00:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:47,214 INFO L93 Difference]: Finished difference Result 328 states and 385 transitions. [2018-04-10 16:00:47,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 16:00:47,214 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-04-10 16:00:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:47,215 INFO L225 Difference]: With dead ends: 328 [2018-04-10 16:00:47,215 INFO L226 Difference]: Without dead ends: 328 [2018-04-10 16:00:47,215 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=161, Invalid=1168, Unknown=3, NotChecked=0, Total=1332 [2018-04-10 16:00:47,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-04-10 16:00:47,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 315. [2018-04-10 16:00:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-04-10 16:00:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 368 transitions. [2018-04-10 16:00:47,219 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 368 transitions. Word has length 53 [2018-04-10 16:00:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:47,220 INFO L459 AbstractCegarLoop]: Abstraction has 315 states and 368 transitions. [2018-04-10 16:00:47,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 16:00:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 368 transitions. [2018-04-10 16:00:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-10 16:00:47,220 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:47,221 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 16:00:47,221 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:47,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1135548646, now seen corresponding path program 1 times [2018-04-10 16:00:47,221 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:47,221 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:47,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:47,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:47,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:47,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:47,232 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:47,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:47,232 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:47,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:47,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:47,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:47,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:47,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:47,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-04-10 16:00:47,278 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 16:00:47,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:47,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:47,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:47,293 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 16:00:47,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:47,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:47,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:47,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:47,303 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-10 16:00:47,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2018-04-10 16:00:47,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:00:47,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-04-10 16:00:47,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:47,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:47,751 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 1 case distinctions, treesize of input 36 treesize of output 40 [2018-04-10 16:00:47,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-04-10 16:00:47,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:47,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:00:47,758 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:47,763 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:47,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:47,806 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 35 treesize of output 55 [2018-04-10 16:00:47,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-04-10 16:00:47,809 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:47,833 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:47,842 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:47,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:47,851 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 43 treesize of output 45 [2018-04-10 16:00:47,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-04-10 16:00:47,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:47,859 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 28 treesize of output 34 [2018-04-10 16:00:47,859 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:47,866 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:47,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:47,884 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 35 treesize of output 32 [2018-04-10 16:00:47,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:47,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 40 [2018-04-10 16:00:47,898 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-04-10 16:00:47,923 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:00:47,952 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:00:48,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:48,030 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 43 treesize of output 45 [2018-04-10 16:00:48,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 31 treesize of output 28 [2018-04-10 16:00:48,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:48,036 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 28 treesize of output 34 [2018-04-10 16:00:48,036 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:48,041 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:48,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:48,053 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 35 treesize of output 32 [2018-04-10 16:00:48,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:48,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 40 [2018-04-10 16:00:48,065 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 4 xjuncts. [2018-04-10 16:00:48,087 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:00:48,106 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 16:00:48,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:48,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2018-04-10 16:00:48,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-04-10 16:00:48,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:48,121 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 16:00:48,122 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:48,126 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:48,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:48,146 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 35 treesize of output 55 [2018-04-10 16:00:48,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-04-10 16:00:48,149 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:48,185 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:48,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-04-10 16:00:48,186 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:48,199 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:00:48,213 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:00:48,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 22 dim-0 vars, and 14 xjuncts. [2018-04-10 16:00:48,305 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 11 variables, input treesize:138, output treesize:934 [2018-04-10 16:00:48,683 WARN L151 SmtUtils]: Spent 300ms on a formula simplification. DAG size of input: 227 DAG size of output 71 [2018-04-10 16:00:48,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-10 16:00:48,930 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:48,930 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 16 treesize of output 13 [2018-04-10 16:00:48,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:48,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:48,940 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 16:00:48,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:45 [2018-04-10 16:00:49,022 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 16:00:49,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:49,025 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 16:00:49,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:20 [2018-04-10 16:00:49,078 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 41 treesize of output 33 [2018-04-10 16:00:49,079 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 33 treesize of output 22 [2018-04-10 16:00:49,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:49,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:49,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:49,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2018-04-10 16:00:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:00:49,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:00:49,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 16:00:49,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:00:49,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:00:49,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:00:49,333 INFO L87 Difference]: Start difference. First operand 315 states and 368 transitions. Second operand 21 states. [2018-04-10 16:00:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:50,647 INFO L93 Difference]: Finished difference Result 329 states and 385 transitions. [2018-04-10 16:00:50,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 16:00:50,648 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-04-10 16:00:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:50,648 INFO L225 Difference]: With dead ends: 329 [2018-04-10 16:00:50,648 INFO L226 Difference]: Without dead ends: 302 [2018-04-10 16:00:50,649 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2018-04-10 16:00:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-10 16:00:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 292. [2018-04-10 16:00:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-04-10 16:00:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 344 transitions. [2018-04-10 16:00:50,653 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 344 transitions. Word has length 55 [2018-04-10 16:00:50,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:50,653 INFO L459 AbstractCegarLoop]: Abstraction has 292 states and 344 transitions. [2018-04-10 16:00:50,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:00:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 344 transitions. [2018-04-10 16:00:50,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-10 16:00:50,654 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:50,655 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] [2018-04-10 16:00:50,655 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:50,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1137084526, now seen corresponding path program 1 times [2018-04-10 16:00:50,655 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:50,655 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:50,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:50,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:50,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:50,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:00:50,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:50,687 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:50,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:50,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:50,705 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:00:50,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:00:50,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-04-10 16:00:50,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:00:50,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:00:50,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:00:50,706 INFO L87 Difference]: Start difference. First operand 292 states and 344 transitions. Second operand 7 states. [2018-04-10 16:00:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:50,725 INFO L93 Difference]: Finished difference Result 304 states and 356 transitions. [2018-04-10 16:00:50,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:00:50,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-04-10 16:00:50,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:50,726 INFO L225 Difference]: With dead ends: 304 [2018-04-10 16:00:50,726 INFO L226 Difference]: Without dead ends: 304 [2018-04-10 16:00:50,727 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:00:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-04-10 16:00:50,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 299. [2018-04-10 16:00:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-04-10 16:00:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 351 transitions. [2018-04-10 16:00:50,731 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 351 transitions. Word has length 54 [2018-04-10 16:00:50,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:50,731 INFO L459 AbstractCegarLoop]: Abstraction has 299 states and 351 transitions. [2018-04-10 16:00:50,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:00:50,732 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 351 transitions. [2018-04-10 16:00:50,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-10 16:00:50,732 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:50,732 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:50,732 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:50,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1946526015, now seen corresponding path program 1 times [2018-04-10 16:00:50,733 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:50,733 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:50,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:50,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:50,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:50,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:50,747 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:50,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:50,747 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:50,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:50,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:50,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:50,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:50,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:50,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:50,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:50,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-10 16:00:50,922 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 16:00:50,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:50,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:50,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:50,934 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 16:00:50,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:48 [2018-04-10 16:00:50,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:50,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:50,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:50,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:50,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 33 treesize of output 63 [2018-04-10 16:00:50,992 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 34 treesize of output 49 [2018-04-10 16:00:50,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:51,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:51,010 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 16:00:51,010 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:51,019 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 16:00:51,019 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2018-04-10 16:00:51,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-10 16:00:51,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:51,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:00:51,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:12 [2018-04-10 16:00:51,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-10 16:00:51,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-04-10 16:00:51,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:51,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:51,155 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 16:00:51,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:28 [2018-04-10 16:00:51,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:51,193 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 16:00:51,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:51,203 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 16:00:51,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:20 [2018-04-10 16:00:51,240 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 16:00:51,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:51,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-10 16:00:51,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 16:00:51,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 16:00:51,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:00:51,241 INFO L87 Difference]: Start difference. First operand 299 states and 351 transitions. Second operand 14 states. [2018-04-10 16:00:52,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:52,396 INFO L93 Difference]: Finished difference Result 406 states and 485 transitions. [2018-04-10 16:00:52,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 16:00:52,396 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-04-10 16:00:52,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:52,397 INFO L225 Difference]: With dead ends: 406 [2018-04-10 16:00:52,397 INFO L226 Difference]: Without dead ends: 406 [2018-04-10 16:00:52,397 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:00:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-04-10 16:00:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 303. [2018-04-10 16:00:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-04-10 16:00:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 361 transitions. [2018-04-10 16:00:52,401 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 361 transitions. Word has length 55 [2018-04-10 16:00:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:52,401 INFO L459 AbstractCegarLoop]: Abstraction has 303 states and 361 transitions. [2018-04-10 16:00:52,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 16:00:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 361 transitions. [2018-04-10 16:00:52,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-10 16:00:52,401 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:52,402 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:52,402 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:52,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1382711762, now seen corresponding path program 1 times [2018-04-10 16:00:52,402 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:52,402 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:52,402 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:52,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:52,402 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:52,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:52,411 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:52,411 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:52,411 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:52,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:52,427 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:52,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:00:52,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:52,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 16:00:52,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:52,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:52,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-10 16:00:52,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 16:00:52,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-04-10 16:00:52,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:52,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:52,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,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 25 treesize of output 51 [2018-04-10 16:00:52,542 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 30 treesize of output 37 [2018-04-10 16:00:52,542 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:52,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:52,555 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 16:00:52,555 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:35 [2018-04-10 16:00:52,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,579 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 16 treesize of output 13 [2018-04-10 16:00:52,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:52,588 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 16:00:52,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-04-10 16:00:52,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 88 [2018-04-10 16:00:52,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:00:52,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:52,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 51 [2018-04-10 16:00:52,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-10 16:00:52,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-10 16:00:52,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:65, output treesize:82 [2018-04-10 16:00:52,896 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 16:00:52,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:52,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-10 16:00:52,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 16:00:52,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 16:00:52,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-04-10 16:00:52,897 INFO L87 Difference]: Start difference. First operand 303 states and 361 transitions. Second operand 12 states. [2018-04-10 16:00:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:54,123 INFO L93 Difference]: Finished difference Result 381 states and 448 transitions. [2018-04-10 16:00:54,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:00:54,123 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-10 16:00:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:54,124 INFO L225 Difference]: With dead ends: 381 [2018-04-10 16:00:54,124 INFO L226 Difference]: Without dead ends: 381 [2018-04-10 16:00:54,124 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:00:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-04-10 16:00:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 345. [2018-04-10 16:00:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-04-10 16:00:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 415 transitions. [2018-04-10 16:00:54,129 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 415 transitions. Word has length 55 [2018-04-10 16:00:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:54,130 INFO L459 AbstractCegarLoop]: Abstraction has 345 states and 415 transitions. [2018-04-10 16:00:54,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 16:00:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 415 transitions. [2018-04-10 16:00:54,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-10 16:00:54,131 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:54,131 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:54,131 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:54,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1943956119, now seen corresponding path program 1 times [2018-04-10 16:00:54,131 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:54,131 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:54,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:54,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:54,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:54,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:54,141 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:54,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:54,142 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:54,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:54,169 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:54,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-10 16:00:54,188 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 15 treesize of output 3 [2018-04-10 16:00:54,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:54,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:54,192 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 16:00:54,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:9 [2018-04-10 16:00:54,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:54,207 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 16:00:54,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:00:54,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:00:54,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:21 [2018-04-10 16:00:54,228 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 16:00:54,228 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:54,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:00:54,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:00:54,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:00:54,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:00:54,229 INFO L87 Difference]: Start difference. First operand 345 states and 415 transitions. Second operand 6 states. [2018-04-10 16:00:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:00:54,326 INFO L93 Difference]: Finished difference Result 348 states and 416 transitions. [2018-04-10 16:00:54,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:00:54,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-04-10 16:00:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:00:54,327 INFO L225 Difference]: With dead ends: 348 [2018-04-10 16:00:54,327 INFO L226 Difference]: Without dead ends: 348 [2018-04-10 16:00:54,327 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:00:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-04-10 16:00:54,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 345. [2018-04-10 16:00:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-04-10 16:00:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 414 transitions. [2018-04-10 16:00:54,333 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 414 transitions. Word has length 55 [2018-04-10 16:00:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:00:54,333 INFO L459 AbstractCegarLoop]: Abstraction has 345 states and 414 transitions. [2018-04-10 16:00:54,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:00:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 414 transitions. [2018-04-10 16:00:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-10 16:00:54,334 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:00:54,334 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:00:54,334 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:00:54,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1641106482, now seen corresponding path program 1 times [2018-04-10 16:00:54,334 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:00:54,334 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:00:54,335 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:54,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:54,335 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:00:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:54,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:00:54,346 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:00:54,346 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:00:54,346 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:00:54,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:00:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:00:54,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:00:54,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:00:54,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:54,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:00:54,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:54,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:54,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-10 16:00:54,408 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 16:00:54,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:54,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:54,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:54,416 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 16:00:54,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:54,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:54,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:54,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:54,421 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-04-10 16:00:55,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:55,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:55,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:55,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:55,073 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 25 treesize of output 51 [2018-04-10 16:00:55,077 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 30 treesize of output 37 [2018-04-10 16:00:55,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:55,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:55,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:00:55,169 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:55,266 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 155 treesize of output 89 [2018-04-10 16:00:55,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:55,269 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:55,308 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 84 treesize of output 66 [2018-04-10 16:00:55,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, 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 16:00:55,311 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:55,342 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 53 treesize of output 55 [2018-04-10 16:00:55,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:55,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:00:55,348 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:55,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 96 [2018-04-10 16:00:55,408 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 16:00:55,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:55,444 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 4 case distinctions, treesize of input 60 treesize of output 79 [2018-04-10 16:00:55,445 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-04-10 16:00:56,209 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 42 treesize of output 36 [2018-04-10 16:00:56,209 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:56,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-04-10 16:00:56,357 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:56,653 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 2 case distinctions, treesize of input 42 treesize of output 49 [2018-04-10 16:00:56,653 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-10 16:00:56,723 INFO L267 ElimStorePlain]: Start of recursive call 11: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:00:56,787 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 16:00:56,845 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:00:56,903 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:00:56,998 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 155 treesize of output 89 [2018-04-10 16:00:57,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 10 treesize of output 9 [2018-04-10 16:00:57,001 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:57,018 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 84 treesize of output 66 [2018-04-10 16:00:57,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:00:57,021 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:57,038 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 53 treesize of output 55 [2018-04-10 16:00:57,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:57,042 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 16:00:57,042 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:57,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 96 [2018-04-10 16:00:57,083 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 16:00:57,093 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:00:57,093 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:57,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-04-10 16:00:57,246 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:57,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:57,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 59 [2018-04-10 16:00:57,293 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 4 xjuncts. [2018-04-10 16:00:57,449 INFO L267 ElimStorePlain]: Start of recursive call 22: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:00:57,483 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:00:57,505 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 16:00:57,526 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 16:00:57,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 16 dim-0 vars, and 8 xjuncts. [2018-04-10 16:00:57,607 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 12 variables, input treesize:353, output treesize:1004 [2018-04-10 16:00:57,899 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 272 DAG size of output 133 [2018-04-10 16:00:58,095 WARN L148 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 137 [2018-04-10 16:00:58,150 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 110 treesize of output 97 [2018-04-10 16:00:58,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 77 treesize of output 62 [2018-04-10 16:00:58,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:58,158 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 16:00:58,158 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:58,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:00:58,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:00:58,173 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:153, output treesize:105 [2018-04-10 16:00:58,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-04-10 16:00:58,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:58,276 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 16:00:58,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:98, output treesize:71 [2018-04-10 16:00:58,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:58,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:58,417 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:58,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:58,418 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 42 treesize of output 121 [2018-04-10 16:00:58,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:58,445 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 16:00:58,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:182, output treesize:140 [2018-04-10 16:00:58,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:58,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:00:58,516 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-04-10 16:00:58,518 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:00:58,519 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 22 treesize of output 19 [2018-04-10 16:00:58,519 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 16:00:58,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-04-10 16:00:58,526 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:58,531 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 16:00:58,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:00:58,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:00:58,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:00:58,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:80, output treesize:24 [2018-04-10 16:00:58,607 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 16:00:58,608 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:00:58,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-04-10 16:00:58,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 16:00:58,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 16:00:58,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=645, Unknown=1, NotChecked=0, Total=702 [2018-04-10 16:00:58,608 INFO L87 Difference]: Start difference. First operand 345 states and 414 transitions. Second operand 27 states. [2018-04-10 16:00:59,873 WARN L151 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 137 DAG size of output 137 [2018-04-10 16:01:00,134 WARN L151 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 141 DAG size of output 141 [2018-04-10 16:01:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:01:01,707 INFO L93 Difference]: Finished difference Result 384 states and 461 transitions. [2018-04-10 16:01:01,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 16:01:01,707 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 57 [2018-04-10 16:01:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:01:01,708 INFO L225 Difference]: With dead ends: 384 [2018-04-10 16:01:01,708 INFO L226 Difference]: Without dead ends: 384 [2018-04-10 16:01:01,708 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=128, Invalid=1431, Unknown=1, NotChecked=0, Total=1560 [2018-04-10 16:01:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-04-10 16:01:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 352. [2018-04-10 16:01:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-04-10 16:01:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 420 transitions. [2018-04-10 16:01:01,713 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 420 transitions. Word has length 57 [2018-04-10 16:01:01,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:01:01,713 INFO L459 AbstractCegarLoop]: Abstraction has 352 states and 420 transitions. [2018-04-10 16:01:01,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 16:01:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 420 transitions. [2018-04-10 16:01:01,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 16:01:01,714 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:01:01,714 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 16:01:01,714 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:01:01,714 INFO L82 PathProgramCache]: Analyzing trace with hash -562675973, now seen corresponding path program 1 times [2018-04-10 16:01:01,714 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:01:01,714 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:01:01,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:01,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:01,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:01,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:01:01,726 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:01:01,726 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:01:01,726 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:01:01,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:01,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:01:01,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:01,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:01,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:01,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:01,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:01,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:01:01,895 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 16:01:01,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:01,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:01,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:01,907 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 16:01:01,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:37 [2018-04-10 16:01:01,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:01,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:01,939 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 16:01:01,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:01,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:01,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:01,953 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 17 treesize of output 24 [2018-04-10 16:01:01,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:01,964 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 16:01:01,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:43 [2018-04-10 16:01:02,395 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 16:01:02,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:01:02,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:02,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:02,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:02,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-04-10 16:01:02,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-10 16:01:02,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:02,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:02,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:02,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:02,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:65 [2018-04-10 16:01:02,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:02,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:02,673 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 16:01:02,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:02,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:02,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:02,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:02,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:02,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-10 16:01:02,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:02,718 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 0 case distinctions, treesize of input 31 treesize of output 35 [2018-04-10 16:01:02,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16:01:02,722 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 16:01:02,722 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:02,725 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:02,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:02,732 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2018-04-10 16:01:02,734 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:02,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-04-10 16:01:02,735 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:02,738 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:02,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:02,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:02,754 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:101, output treesize:47 [2018-04-10 16:01:02,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:02,854 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:02,856 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 61 treesize of output 61 [2018-04-10 16:01:02,857 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:02,857 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 42 treesize of output 26 [2018-04-10 16:01:02,858 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 16:01:02,863 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:02,864 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 15 [2018-04-10 16:01:02,864 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:02,868 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 16:01:02,875 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 16:01:02,877 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:02,877 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 11 [2018-04-10 16:01:02,877 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:02,881 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:02,881 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 16:01:02,882 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:02,884 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:02,887 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 16:01:02,887 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:81, output treesize:7 [2018-04-10 16:01:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:01:02,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:01:02,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-10 16:01:02,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 16:01:02,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 16:01:02,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=586, Unknown=1, NotChecked=0, Total=650 [2018-04-10 16:01:02,986 INFO L87 Difference]: Start difference. First operand 352 states and 420 transitions. Second operand 26 states. [2018-04-10 16:01:04,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:01:04,859 INFO L93 Difference]: Finished difference Result 361 states and 426 transitions. [2018-04-10 16:01:04,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:01:04,859 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 60 [2018-04-10 16:01:04,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:01:04,860 INFO L225 Difference]: With dead ends: 361 [2018-04-10 16:01:04,860 INFO L226 Difference]: Without dead ends: 361 [2018-04-10 16:01:04,860 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=157, Invalid=1402, Unknown=1, NotChecked=0, Total=1560 [2018-04-10 16:01:04,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-04-10 16:01:04,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 352. [2018-04-10 16:01:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-04-10 16:01:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 418 transitions. [2018-04-10 16:01:04,863 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 418 transitions. Word has length 60 [2018-04-10 16:01:04,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:01:04,863 INFO L459 AbstractCegarLoop]: Abstraction has 352 states and 418 transitions. [2018-04-10 16:01:04,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 16:01:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 418 transitions. [2018-04-10 16:01:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 16:01:04,864 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:01:04,864 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:01:04,864 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:01:04,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1817611563, now seen corresponding path program 1 times [2018-04-10 16:01:04,864 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:01:04,864 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:01:04,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:04,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:04,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:04,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:01:04,874 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:01:04,874 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:01:04,874 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:01:04,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:04,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:01:04,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:01:04,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:04,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:04,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:04,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:04,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:01:04,933 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 16:01:04,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:04,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:04,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:04,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:04,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-10 16:01:05,242 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 16:01:05,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:05,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:05,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:05,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:05,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:211, output treesize:248 [2018-04-10 16:01:05,368 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 16:01:05,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:05,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:05,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:05,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:05,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:05,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 27 [2018-04-10 16:01:05,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:05,450 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 0 case distinctions, treesize of input 195 treesize of output 101 [2018-04-10 16:01:05,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:05,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:05,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 96 treesize of output 78 [2018-04-10 16:01:05,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:05,472 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:05,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:05,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 76 [2018-04-10 16:01:05,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:05,492 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 37 treesize of output 47 [2018-04-10 16:01:05,492 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:05,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:05,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:05,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:05,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 80 [2018-04-10 16:01:05,512 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:05,521 INFO L477 Elim1Store]: Elim1 applied some 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 4 case distinctions, treesize of input 35 treesize of output 50 [2018-04-10 16:01:05,521 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 16:01:05,536 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:05,541 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 16:01:05,545 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 16:01:05,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:05,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:05,567 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:255, output treesize:111 [2018-04-10 16:01:05,606 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 95 treesize of output 81 [2018-04-10 16:01:05,607 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:05,608 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 81 treesize of output 70 [2018-04-10 16:01:05,608 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 16:01:05,615 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 16:01:05,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:05,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:125, output treesize:94 [2018-04-10 16:01:05,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:05,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:05,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 59 [2018-04-10 16:01:05,665 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 16:01:05,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:05,671 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:05,671 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 26 treesize of output 18 [2018-04-10 16:01:05,671 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:05,676 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 19 treesize of output 13 [2018-04-10 16:01:05,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:05,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:05,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:05,685 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:101, output treesize:4 [2018-04-10 16:01:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:01:05,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:01:05,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-04-10 16:01:05,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 16:01:05,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 16:01:05,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2018-04-10 16:01:05,753 INFO L87 Difference]: Start difference. First operand 352 states and 418 transitions. Second operand 23 states. [2018-04-10 16:01:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:01:09,121 INFO L93 Difference]: Finished difference Result 366 states and 433 transitions. [2018-04-10 16:01:09,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:01:09,121 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2018-04-10 16:01:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:01:09,122 INFO L225 Difference]: With dead ends: 366 [2018-04-10 16:01:09,122 INFO L226 Difference]: Without dead ends: 364 [2018-04-10 16:01:09,123 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-04-10 16:01:09,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-04-10 16:01:09,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 350. [2018-04-10 16:01:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-04-10 16:01:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 415 transitions. [2018-04-10 16:01:09,126 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 415 transitions. Word has length 60 [2018-04-10 16:01:09,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:01:09,127 INFO L459 AbstractCegarLoop]: Abstraction has 350 states and 415 transitions. [2018-04-10 16:01:09,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 16:01:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 415 transitions. [2018-04-10 16:01:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 16:01:09,128 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:01:09,128 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:01:09,128 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:01:09,128 INFO L82 PathProgramCache]: Analyzing trace with hash -590339811, now seen corresponding path program 1 times [2018-04-10 16:01:09,128 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:01:09,128 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:01:09,129 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:09,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:09,129 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:09,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:01:09,147 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:01:09,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:01:09,147 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:01:09,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:09,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:01:09,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:09,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:09,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:09,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:09,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:09,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-10 16:01:09,196 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 16:01:09,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:09,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:09,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:09,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:09,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-10 16:01:09,725 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 69 DAG size of output 64 [2018-04-10 16:01:09,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:09,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:09,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:09,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:09,735 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 16:01:09,738 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 30 treesize of output 37 [2018-04-10 16:01:09,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:09,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:09,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:09,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:09,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:09,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:09,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:09,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:09,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:09,774 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 30 treesize of output 68 [2018-04-10 16:01:09,778 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 35 treesize of output 54 [2018-04-10 16:01:09,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:09,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:09,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:09,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:09,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 18 [2018-04-10 16:01:09,887 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:09,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-04-10 16:01:09,891 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:09,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:09,961 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 0 case distinctions, treesize of input 155 treesize of output 89 [2018-04-10 16:01:09,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:09,964 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:09,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:09,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 84 treesize of output 66 [2018-04-10 16:01:09,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:09,997 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:10,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:10,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 53 treesize of output 55 [2018-04-10 16:01:10,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:10,020 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 16:01:10,020 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:10,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:10,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 51 [2018-04-10 16:01:10,054 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 2 case distinctions, treesize of input 14 treesize of output 19 [2018-04-10 16:01:10,054 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:10,068 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:01:10,094 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:01:10,121 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:01:10,140 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:01:10,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2018-04-10 16:01:10,178 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 11 variables, input treesize:216, output treesize:253 [2018-04-10 16:01:10,271 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 70 treesize of output 51 [2018-04-10 16:01:10,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:10,290 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 63 treesize of output 44 [2018-04-10 16:01:10,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:10,305 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 2 xjuncts. [2018-04-10 16:01:10,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:134, output treesize:96 [2018-04-10 16:01:10,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-04-10 16:01:10,782 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 16:01:10,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:10,792 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-04-10 16:01:10,792 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:10,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:10,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 32 [2018-04-10 16:01:10,821 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 11 treesize of output 7 [2018-04-10 16:01:10,822 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:10,826 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:10,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2018-04-10 16:01:10,847 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 16:01:10,847 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:10,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2018-04-10 16:01:10,860 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:10,871 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:01:10,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-04-10 16:01:10,898 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 17 treesize of output 11 [2018-04-10 16:01:10,899 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:10,904 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:10,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 37 [2018-04-10 16:01:10,906 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 17 treesize of output 11 [2018-04-10 16:01:10,907 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:10,914 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:10,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:01:10,932 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 11 variables, input treesize:136, output treesize:46 [2018-04-10 16:01:11,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:11,003 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 12 treesize of output 21 [2018-04-10 16:01:11,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:11,007 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 16:01:11,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-04-10 16:01:11,079 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 16:01:11,079 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:01:11,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-04-10 16:01:11,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 16:01:11,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 16:01:11,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=500, Unknown=1, NotChecked=0, Total=552 [2018-04-10 16:01:11,080 INFO L87 Difference]: Start difference. First operand 350 states and 415 transitions. Second operand 24 states. [2018-04-10 16:01:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:01:15,536 INFO L93 Difference]: Finished difference Result 478 states and 561 transitions. [2018-04-10 16:01:15,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 16:01:15,537 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2018-04-10 16:01:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:01:15,538 INFO L225 Difference]: With dead ends: 478 [2018-04-10 16:01:15,538 INFO L226 Difference]: Without dead ends: 478 [2018-04-10 16:01:15,538 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=197, Invalid=1524, Unknown=1, NotChecked=0, Total=1722 [2018-04-10 16:01:15,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-04-10 16:01:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 396. [2018-04-10 16:01:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-04-10 16:01:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 474 transitions. [2018-04-10 16:01:15,542 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 474 transitions. Word has length 60 [2018-04-10 16:01:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:01:15,542 INFO L459 AbstractCegarLoop]: Abstraction has 396 states and 474 transitions. [2018-04-10 16:01:15,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 16:01:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 474 transitions. [2018-04-10 16:01:15,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 16:01:15,543 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:01:15,543 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:01:15,543 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:01:15,544 INFO L82 PathProgramCache]: Analyzing trace with hash 763384283, now seen corresponding path program 1 times [2018-04-10 16:01:15,544 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:01:15,544 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:01:15,544 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:15,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:15,545 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:15,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:01:15,556 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:01:15,556 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:01:15,556 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:01:15,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:15,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:01:15,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:01:15,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:15,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:01:15,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:15,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:15,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-10 16:01:15,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,687 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-04-10 16:01:15,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-04-10 16:01:15,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:15,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:15,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-04-10 16:01: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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-04-10 16:01:15,718 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:15,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:15,731 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 16:01:15,731 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:39 [2018-04-10 16:01:15,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-10 16:01:15,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:15,770 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 16:01:15,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:27 [2018-04-10 16:01:15,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:15,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 90 [2018-04-10 16:01:16,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:16,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,079 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 75 [2018-04-10 16:01:16,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,094 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 0 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 105 [2018-04-10 16:01:16,095 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-10 16:01:16,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 87 [2018-04-10 16:01:16,194 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:16,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:16,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 89 [2018-04-10 16:01:16,268 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:16,384 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-10 16:01:16,485 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 45 treesize of output 39 [2018-04-10 16:01:16,487 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 24 treesize of output 9 [2018-04-10 16:01:16,488 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:16,493 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:16,495 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 39 treesize of output 35 [2018-04-10 16:01:16,496 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 16:01:16,496 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:16,502 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:16,504 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 43 treesize of output 37 [2018-04-10 16:01:16,505 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 24 treesize of output 9 [2018-04-10 16:01:16,505 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:16,511 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:16,513 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 39 treesize of output 35 [2018-04-10 16:01:16,515 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 16:01:16,515 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:16,520 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:16,522 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 43 treesize of output 37 [2018-04-10 16:01:16,523 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 24 treesize of output 9 [2018-04-10 16:01:16,524 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:16,529 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:16,531 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 41 treesize of output 37 [2018-04-10 16:01:16,533 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 16:01:16,533 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:16,539 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:16,541 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 45 treesize of output 39 [2018-04-10 16:01:16,543 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 24 treesize of output 9 [2018-04-10 16:01:16,543 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:16,548 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:16,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 20 dim-0 vars, and 10 xjuncts. [2018-04-10 16:01:16,640 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 10 variables, input treesize:96, output treesize:355 [2018-04-10 16:01:16,766 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 16:01:16,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:01:16,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-10 16:01:16,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 16:01:16,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 16:01:16,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:01:16,767 INFO L87 Difference]: Start difference. First operand 396 states and 474 transitions. Second operand 15 states. [2018-04-10 16:01:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:01:18,431 INFO L93 Difference]: Finished difference Result 445 states and 517 transitions. [2018-04-10 16:01:18,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 16:01:18,431 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-04-10 16:01:18,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:01:18,432 INFO L225 Difference]: With dead ends: 445 [2018-04-10 16:01:18,432 INFO L226 Difference]: Without dead ends: 445 [2018-04-10 16:01:18,432 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:01:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-04-10 16:01:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 393. [2018-04-10 16:01:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-04-10 16:01:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 469 transitions. [2018-04-10 16:01:18,436 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 469 transitions. Word has length 60 [2018-04-10 16:01:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:01:18,436 INFO L459 AbstractCegarLoop]: Abstraction has 393 states and 469 transitions. [2018-04-10 16:01:18,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 16:01:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 469 transitions. [2018-04-10 16:01:18,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-10 16:01:18,437 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:01:18,437 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:01:18,437 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:01:18,437 INFO L82 PathProgramCache]: Analyzing trace with hash 897208251, now seen corresponding path program 2 times [2018-04-10 16:01:18,438 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:01:18,438 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:01:18,438 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:18,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:18,438 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:18,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:01:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:01:18,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:01:18,480 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:01:18,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:01:18,486 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-10 16:01:18,486 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:01:18,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:01:18,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:18,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:18,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:18,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:01:18,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:18,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:18,607 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 16:01:18,612 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 16:01:18,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:18,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:18,620 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 16:01:18,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-04-10 16:01:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-04-10 16:01:18,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:01:18,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-04-10 16:01:18,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 16:01:18,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 16:01:18,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-04-10 16:01:18,659 INFO L87 Difference]: Start difference. First operand 393 states and 469 transitions. Second operand 13 states. [2018-04-10 16:01:19,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:01:19,463 INFO L93 Difference]: Finished difference Result 411 states and 489 transitions. [2018-04-10 16:01:19,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:01:19,463 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-04-10 16:01:19,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:01:19,464 INFO L225 Difference]: With dead ends: 411 [2018-04-10 16:01:19,464 INFO L226 Difference]: Without dead ends: 411 [2018-04-10 16:01:19,464 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-04-10 16:01:19,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-04-10 16:01:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 399. [2018-04-10 16:01:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-04-10 16:01:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 475 transitions. [2018-04-10 16:01:19,468 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 475 transitions. Word has length 61 [2018-04-10 16:01:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:01:19,469 INFO L459 AbstractCegarLoop]: Abstraction has 399 states and 475 transitions. [2018-04-10 16:01:19,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 16:01:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 475 transitions. [2018-04-10 16:01:19,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 16:01:19,470 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:01:19,470 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:01:19,470 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:01:19,470 INFO L82 PathProgramCache]: Analyzing trace with hash -827109317, now seen corresponding path program 1 times [2018-04-10 16:01:19,470 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:01:19,470 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:01:19,471 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:19,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:01:19,471 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:19,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:01:19,480 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:01:19,480 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:01:19,480 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:01:19,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:19,518 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:01:19,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:19,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:19,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:19,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:01:19,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:19,533 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 16:01:19,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:19,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:19,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2018-04-10 16:01:19,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:01:19,689 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 16:01:19,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:19,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:19,708 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 16:01:19,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-04-10 16:01:19,753 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 16:01:19,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:19,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:19,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:19,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 53 [2018-04-10 16:01:19,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-10 16:01:19,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:19,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:19,838 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 2 case distinctions, treesize of input 39 treesize of output 55 [2018-04-10 16:01:19,839 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 16:01:19,865 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 16:01:19,893 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 16:01:19,893 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:77, output treesize:169 [2018-04-10 16:01:20,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 164 [2018-04-10 16:01:20,013 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 83 treesize of output 126 [2018-04-10 16:01:20,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:20,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:20,040 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 16:01:20,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:195, output treesize:96 [2018-04-10 16:01:20,074 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 16:01:20,076 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:20,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2018-04-10 16:01:20,077 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 16:01:20,093 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 16:01:20,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:20,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:86 [2018-04-10 16:01:20,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-04-10 16:01:20,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:20,192 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 16:01:20,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:68 [2018-04-10 16:01:20,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,586 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 64 treesize of output 224 [2018-04-10 16:01:20,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,592 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:20,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 188 [2018-04-10 16:01:20,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:20,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:20,660 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 16:01:20,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:194, output treesize:172 [2018-04-10 16:01:20,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,739 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:20,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:20,744 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 0 case distinctions, treesize of input 92 treesize of output 82 [2018-04-10 16:01:20,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2018-04-10 16:01:20,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:20,757 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:20,758 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 14 treesize of output 13 [2018-04-10 16:01:20,758 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 16:01:20,766 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:20,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-10 16:01:20,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:20,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:20,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:20,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:115, output treesize:29 [2018-04-10 16:01:20,845 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 16:01:20,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:01:20,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-04-10 16:01:20,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 16:01:20,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 16:01:20,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=624, Unknown=1, NotChecked=0, Total=702 [2018-04-10 16:01:20,846 INFO L87 Difference]: Start difference. First operand 399 states and 475 transitions. Second operand 27 states. [2018-04-10 16:01:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:01:23,017 INFO L93 Difference]: Finished difference Result 467 states and 549 transitions. [2018-04-10 16:01:23,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 16:01:23,017 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 62 [2018-04-10 16:01:23,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:01:23,018 INFO L225 Difference]: With dead ends: 467 [2018-04-10 16:01:23,018 INFO L226 Difference]: Without dead ends: 467 [2018-04-10 16:01:23,019 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=219, Invalid=2036, Unknown=1, NotChecked=0, Total=2256 [2018-04-10 16:01:23,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-04-10 16:01:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 414. [2018-04-10 16:01:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-04-10 16:01:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 495 transitions. [2018-04-10 16:01:23,023 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 495 transitions. Word has length 62 [2018-04-10 16:01:23,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:01:23,023 INFO L459 AbstractCegarLoop]: Abstraction has 414 states and 495 transitions. [2018-04-10 16:01:23,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 16:01:23,023 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 495 transitions. [2018-04-10 16:01:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 16:01:23,024 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:01:23,024 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 16:01:23,024 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:01:23,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1522120989, now seen corresponding path program 1 times [2018-04-10 16:01:23,025 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:01:23,025 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:01:23,025 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:23,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:23,025 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:23,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:01:23,036 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:01:23,036 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:01:23,036 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:01:23,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:23,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:01:23,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:23,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:01:23,135 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 16:01:23,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,141 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 16:01:23,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-10 16:01:23,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:23,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:01:23,275 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 16:01:23,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:23,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,285 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 16:01:23,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2018-04-10 16:01:23,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:01:23,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:23,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 16:01:23,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, 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 21 [2018-04-10 16:01:23,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,361 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 16:01:23,361 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 16:01:23,375 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 16:01:23,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:01:23,387 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:37, output treesize:63 [2018-04-10 16:01:23,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:23,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:23,425 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 35 treesize of output 36 [2018-04-10 16:01:23,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,435 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 16:01:23,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:29 [2018-04-10 16:01:23,478 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 16:01:23,479 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 16:01:23,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,485 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 16:01:23,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:32 [2018-04-10 16:01:23,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-04-10 16:01:23,530 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:23,530 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 16:01:23,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,534 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 6 treesize of output 4 [2018-04-10 16:01:23,534 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:23,538 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:5 [2018-04-10 16:01:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 16:01:23,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:01:23,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 16:01:23,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:01:23,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:01:23,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:01:23,602 INFO L87 Difference]: Start difference. First operand 414 states and 495 transitions. Second operand 21 states. [2018-04-10 16:01:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:01:25,119 INFO L93 Difference]: Finished difference Result 469 states and 557 transitions. [2018-04-10 16:01:25,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:01:25,119 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-04-10 16:01:25,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:01:25,120 INFO L225 Difference]: With dead ends: 469 [2018-04-10 16:01:25,120 INFO L226 Difference]: Without dead ends: 469 [2018-04-10 16:01:25,120 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=1332, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 16:01:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-04-10 16:01:25,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 403. [2018-04-10 16:01:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-04-10 16:01:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 474 transitions. [2018-04-10 16:01:25,123 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 474 transitions. Word has length 67 [2018-04-10 16:01:25,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:01:25,123 INFO L459 AbstractCegarLoop]: Abstraction has 403 states and 474 transitions. [2018-04-10 16:01:25,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:01:25,124 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 474 transitions. [2018-04-10 16:01:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 16:01:25,124 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:01:25,124 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:01:25,124 INFO L408 AbstractCegarLoop]: === Iteration 54 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:01:25,124 INFO L82 PathProgramCache]: Analyzing trace with hash 689621497, now seen corresponding path program 1 times [2018-04-10 16:01:25,124 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:01:25,124 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:01:25,125 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:25,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:25,125 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:25,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:01:25,135 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:01:25,135 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:01:25,135 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:01:25,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:25,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:01:25,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:25,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:25,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:25,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:25,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:25,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:01:25,175 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 16:01:25,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:25,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:25,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:25,185 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 16:01:25,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:25,187 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:25,188 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:25,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:25,194 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-10 16:01:25,952 WARN L151 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 78 DAG size of output 74 [2018-04-10 16:01:25,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:25,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:25,966 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2018-04-10 16:01:25,984 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:01:25,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:25,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:25,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:25,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 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 16:01:25,997 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:26,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:26,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:26,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:26,133 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 27 [2018-04-10 16:01:26,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,244 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 0 case distinctions, treesize of input 187 treesize of output 93 [2018-04-10 16:01:26,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:26,249 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,318 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 88 treesize of output 70 [2018-04-10 16:01:26,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:26,323 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,377 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 57 treesize of output 59 [2018-04-10 16:01:26,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:26,384 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 20 treesize of output 27 [2018-04-10 16:01:26,384 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:26,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 59 [2018-04-10 16:01:26,427 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:26,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2018-04-10 16:01:26,428 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,444 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,455 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,467 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 16:01:26,478 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 16:01:26,521 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 0 case distinctions, treesize of input 187 treesize of output 93 [2018-04-10 16:01:26,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:26,524 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,543 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 88 treesize of output 74 [2018-04-10 16:01:26,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:26,545 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,564 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 61 treesize of output 71 [2018-04-10 16:01:26,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:26,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 16:01:26,568 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 65 [2018-04-10 16:01:26,586 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:26,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-10 16:01:26,588 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,595 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,600 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,605 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,617 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:26,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:26,634 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 10 variables, input treesize:427, output treesize:98 [2018-04-10 16:01:27,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:27,328 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:27,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:27,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:27,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 144 [2018-04-10 16:01:27,349 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 111 [2018-04-10 16:01:27,350 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 16:01:27,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:27,401 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:27,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 114 [2018-04-10 16:01:27,406 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 72 treesize of output 63 [2018-04-10 16:01:27,406 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:27,416 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:27,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:27,431 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:162, output treesize:116 [2018-04-10 16:01:27,511 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 65 [2018-04-10 16:01:27,512 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 16:01:27,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:27,520 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 19 treesize of output 15 [2018-04-10 16:01:27,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:27,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:27,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-04-10 16:01:27,529 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 16:01:27,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:27,551 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-04-10 16:01:27,552 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 21 treesize of output 5 [2018-04-10 16:01:27,552 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:27,558 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 16:01:27,558 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:27,562 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:27,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 16:01:27,562 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:27,565 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:27,571 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 16:01:27,571 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:127, output treesize:10 [2018-04-10 16:01:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:01:27,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:01:27,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-10 16:01:27,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 16:01:27,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 16:01:27,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=681, Unknown=3, NotChecked=0, Total=756 [2018-04-10 16:01:27,636 INFO L87 Difference]: Start difference. First operand 403 states and 474 transitions. Second operand 28 states. [2018-04-10 16:01:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:01:29,976 INFO L93 Difference]: Finished difference Result 435 states and 510 transitions. [2018-04-10 16:01:29,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 16:01:29,977 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 65 [2018-04-10 16:01:29,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:01:29,978 INFO L225 Difference]: With dead ends: 435 [2018-04-10 16:01:29,978 INFO L226 Difference]: Without dead ends: 435 [2018-04-10 16:01:29,978 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=157, Invalid=1562, Unknown=3, NotChecked=0, Total=1722 [2018-04-10 16:01:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-04-10 16:01:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 413. [2018-04-10 16:01:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-04-10 16:01:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 484 transitions. [2018-04-10 16:01:29,982 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 484 transitions. Word has length 65 [2018-04-10 16:01:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:01:29,983 INFO L459 AbstractCegarLoop]: Abstraction has 413 states and 484 transitions. [2018-04-10 16:01:29,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 16:01:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 484 transitions. [2018-04-10 16:01:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 16:01:29,984 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:01:29,984 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 16:01:29,984 INFO L408 AbstractCegarLoop]: === Iteration 55 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:01:29,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1688340605, now seen corresponding path program 2 times [2018-04-10 16:01:29,984 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:01:29,984 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:01:29,985 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:29,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:29,985 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:29,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:01:29,997 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:01:29,998 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:01:29,998 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:01:29,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:01:30,012 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-10 16:01:30,012 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:01:30,015 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:01:30,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:30,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-10 16:01:30,097 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 16:01:30,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, 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 16:01:30,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,112 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 16:01:30,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:30,113 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,122 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-04-10 16:01:30,153 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 16:01:30,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-04-10 16:01:30,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:30,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:30,173 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:01:30,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 16:01:30,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 18 [2018-04-10 16:01:30,205 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:30,215 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,219 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,231 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 16:01:30,231 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:48, output treesize:84 [2018-04-10 16:01:30,317 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 54 treesize of output 42 [2018-04-10 16:01:30,318 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 35 treesize of output 27 [2018-04-10 16:01:30,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,335 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:30,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 77 [2018-04-10 16:01:30,340 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:30,340 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:30,341 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 64 treesize of output 73 [2018-04-10 16:01:30,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,360 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:30,360 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 63 treesize of output 58 [2018-04-10 16:01:30,360 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 16:01:30,385 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:30,385 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 52 treesize of output 52 [2018-04-10 16:01:30,385 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:01:30,428 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 45 treesize of output 35 [2018-04-10 16:01:30,429 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:30,430 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 11 [2018-04-10 16:01:30,430 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,437 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 16 treesize of output 7 [2018-04-10 16:01:30,437 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,442 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,447 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 53 treesize of output 41 [2018-04-10 16:01:30,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-04-10 16:01:30,448 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,462 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 26 treesize of output 19 [2018-04-10 16:01:30,463 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,475 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:30,475 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 28 treesize of output 15 [2018-04-10 16:01:30,475 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,484 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,499 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 27 treesize of output 21 [2018-04-10 16:01:30,501 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 3 [2018-04-10 16:01:30,501 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,504 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:30,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-10 16:01:30,533 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:130, output treesize:34 [2018-04-10 16:01:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 16:01:30,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:01:30,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-10 16:01:30,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 16:01:30,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 16:01:30,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=259, Unknown=2, NotChecked=0, Total=306 [2018-04-10 16:01:30,649 INFO L87 Difference]: Start difference. First operand 413 states and 484 transitions. Second operand 18 states. [2018-04-10 16:01:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:01:31,596 INFO L93 Difference]: Finished difference Result 487 states and 574 transitions. [2018-04-10 16:01:31,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:01:31,596 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-04-10 16:01:31,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:01:31,598 INFO L225 Difference]: With dead ends: 487 [2018-04-10 16:01:31,598 INFO L226 Difference]: Without dead ends: 487 [2018-04-10 16:01:31,598 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=959, Unknown=7, NotChecked=0, Total=1122 [2018-04-10 16:01:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-04-10 16:01:31,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 432. [2018-04-10 16:01:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-04-10 16:01:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 507 transitions. [2018-04-10 16:01:31,602 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 507 transitions. Word has length 67 [2018-04-10 16:01:31,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:01:31,602 INFO L459 AbstractCegarLoop]: Abstraction has 432 states and 507 transitions. [2018-04-10 16:01:31,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 16:01:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 507 transitions. [2018-04-10 16:01:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 16:01:31,602 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:01:31,603 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 16:01:31,603 INFO L408 AbstractCegarLoop]: === Iteration 56 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:01:31,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1688340604, now seen corresponding path program 1 times [2018-04-10 16:01:31,603 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:01:31,603 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:01:31,604 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:31,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:01:31,604 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:31,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:01:31,613 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:01:31,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:01:31,613 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:01:31,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:31,645 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:01:31,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:31,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:31,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:01:31,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:31,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:31,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:01:31,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:31,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:31,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:31,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:31,746 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 25 treesize of output 51 [2018-04-10 16:01:31,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-04-10 16:01:31,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:31,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:31,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:31,765 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-04-10 16:01:31,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-04-10 16:01:31,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:31,773 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:31,783 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 16:01:31,784 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:38 [2018-04-10 16:01:31,959 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 16:01:31,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, 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 16:01:31,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:31,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:31,978 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 16:01:31,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:01:31,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:31,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:31,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:31,993 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-04-10 16:01:32,051 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 16:01:32,053 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 20 treesize of output 19 [2018-04-10 16:01:32,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:32,073 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 16:01:32,073 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:32,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:01:32,126 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 16:01:32,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 16:01:32,128 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:32,148 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:32,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:01:32,167 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:67, output treesize:147 [2018-04-10 16:01:32,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:32,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:32,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:32,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-10 16:01:32,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:32,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:32,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:32,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:32,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:32,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 44 [2018-04-10 16:01:32,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:32,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:32,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:201, output treesize:62 [2018-04-10 16:01:32,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:32,468 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:32,470 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 61 treesize of output 61 [2018-04-10 16:01:32,471 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:32,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2018-04-10 16:01:32,472 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 16:01:32,479 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:32,479 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 16:01:32,479 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:32,485 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 16:01:32,501 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 16:01:32,503 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:32,503 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 16:01:32,503 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:32,510 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 16:01:32,510 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:32,512 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:32,519 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 16:01:32,519 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:91, output treesize:7 [2018-04-10 16:01:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-10 16:01:32,650 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:01:32,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-10 16:01:32,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:01:32,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:01:32,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:01:32,650 INFO L87 Difference]: Start difference. First operand 432 states and 507 transitions. Second operand 21 states. [2018-04-10 16:01:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:01:35,405 INFO L93 Difference]: Finished difference Result 457 states and 533 transitions. [2018-04-10 16:01:35,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 16:01:35,406 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-04-10 16:01:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:01:35,407 INFO L225 Difference]: With dead ends: 457 [2018-04-10 16:01:35,407 INFO L226 Difference]: Without dead ends: 457 [2018-04-10 16:01:35,407 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=178, Invalid=1228, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 16:01:35,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-04-10 16:01:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 424. [2018-04-10 16:01:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-04-10 16:01:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 494 transitions. [2018-04-10 16:01:35,410 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 494 transitions. Word has length 67 [2018-04-10 16:01:35,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:01:35,411 INFO L459 AbstractCegarLoop]: Abstraction has 424 states and 494 transitions. [2018-04-10 16:01:35,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:01:35,411 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 494 transitions. [2018-04-10 16:01:35,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 16:01:35,411 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:01:35,411 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 16:01:35,411 INFO L408 AbstractCegarLoop]: === Iteration 57 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:01:35,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1300371382, now seen corresponding path program 1 times [2018-04-10 16:01:35,411 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:01:35,411 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:01:35,412 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:35,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:35,412 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:01:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:35,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:01:35,423 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:01:35,423 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:01:35,423 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:01:35,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:01:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:01:35,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:01:35,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:35,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:35,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:35,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:01:35,546 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 16:01:35,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:35,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:35,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:35,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:01:35,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:01:35,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:35,558 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:35,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:35,563 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-10 16:01:35,659 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 16:01:35,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-10 16:01:35,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:35,678 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 19 treesize of output 26 [2018-04-10 16:01:35,679 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:35,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:01:35,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, 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 16:01:35,722 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 22 treesize of output 21 [2018-04-10 16:01:35,722 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:35,742 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 19 treesize of output 26 [2018-04-10 16:01:35,742 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:35,753 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:01:35,779 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 4 xjuncts. [2018-04-10 16:01:35,779 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:73, output treesize:218 [2018-04-10 16:01:35,887 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 60 treesize of output 57 [2018-04-10 16:01:35,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:01:35,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:35,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:35,967 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 82 treesize of output 102 [2018-04-10 16:01:35,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 86 [2018-04-10 16:01:35,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:36,033 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 80 treesize of output 87 [2018-04-10 16:01:36,033 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:36,079 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:01:36,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 78 [2018-04-10 16:01:36,161 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 69 treesize of output 61 [2018-04-10 16:01:36,161 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:36,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 69 [2018-04-10 16:01:36,217 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:36,267 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:01:36,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 78 treesize of output 104 [2018-04-10 16:01:36,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 88 [2018-04-10 16:01:36,300 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:01:36,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-04-10 16:01:36,507 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:36,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 87 [2018-04-10 16:01:36,685 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:36,803 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 3 case distinctions, treesize of input 73 treesize of output 79 [2018-04-10 16:01:36,804 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:36,903 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-10 16:01:37,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 66 [2018-04-10 16:01:37,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-04-10 16:01:37,092 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:37,125 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:37,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 7 xjuncts. [2018-04-10 16:01:37,301 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 11 variables, input treesize:143, output treesize:608 [2018-04-10 16:01:37,717 WARN L151 SmtUtils]: Spent 316ms on a formula simplification. DAG size of input: 164 DAG size of output 121 [2018-04-10 16:01:37,724 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:01:37,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:37,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:37,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:37,793 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 82 treesize of output 92 [2018-04-10 16:01:37,794 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 33 treesize of output 58 [2018-04-10 16:01:37,794 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:37,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:37,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:37,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:37,863 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 104 treesize of output 114 [2018-04-10 16:01:37,866 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 33 treesize of output 40 [2018-04-10 16:01:37,866 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:37,879 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:37,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:01:37,906 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 13 variables, input treesize:462, output treesize:178 [2018-04-10 16:01:38,117 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 114 treesize of output 83 [2018-04-10 16:01:38,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:38,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:38,145 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 76 treesize of output 70 [2018-04-10 16:01:38,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:38,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:01:38,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:198, output treesize:133 [2018-04-10 16:01:38,505 WARN L148 SmtUtils]: Spent 120ms on a formula simplification that was a NOOP. DAG size: 62 [2018-04-10 16:01:38,745 WARN L148 SmtUtils]: Spent 167ms on a formula simplification that was a NOOP. DAG size: 113 [2018-04-10 16:01:39,057 WARN L148 SmtUtils]: Spent 240ms on a formula simplification that was a NOOP. DAG size: 117 [2018-04-10 16:01:39,258 WARN L148 SmtUtils]: Spent 135ms on a formula simplification that was a NOOP. DAG size: 109 [2018-04-10 16:01:39,427 WARN L148 SmtUtils]: Spent 106ms on a formula simplification that was a NOOP. DAG size: 108 [2018-04-10 16:01:39,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:39,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:39,454 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 4 case distinctions, treesize of input 225 treesize of output 276 [2018-04-10 16:01:39,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:01:40,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:40,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:40,084 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 4 case distinctions, treesize of input 194 treesize of output 245 [2018-04-10 16:01:40,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-10 16:01:40,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:40,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:40,930 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 4 case distinctions, treesize of input 204 treesize of output 255 [2018-04-10 16:01:40,931 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-10 16:01:41,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:41,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:41,844 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 4 case distinctions, treesize of input 218 treesize of output 287 [2018-04-10 16:01:41,845 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-04-10 16:01:42,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:42,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:42,918 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 4 case distinctions, treesize of input 204 treesize of output 263 [2018-04-10 16:01:42,919 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-04-10 16:01:44,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:44,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:44,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 194 treesize of output 245 [2018-04-10 16:01:44,209 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-10 16:01:45,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:45,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:45,638 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 4 case distinctions, treesize of input 180 treesize of output 231 [2018-04-10 16:01:45,639 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-10 16:01:47,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:47,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:47,170 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 4 case distinctions, treesize of input 180 treesize of output 231 [2018-04-10 16:01:47,171 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-04-10 16:01:48,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 40 dim-0 vars, 8 dim-1 vars, End of recursive call: 120 dim-0 vars, and 24 xjuncts. [2018-04-10 16:01:48,840 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 48 variables, input treesize:1621, output treesize:4701 [2018-04-10 16:01:50,477 WARN L151 SmtUtils]: Spent 1015ms on a formula simplification. DAG size of input: 1319 DAG size of output 389 [2018-04-10 16:01:50,498 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:01:50,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:50,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:50,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:50,916 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:50,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:50,920 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 0 case distinctions, treesize of input 138 treesize of output 130 [2018-04-10 16:01:50,922 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:50,923 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 44 treesize of output 35 [2018-04-10 16:01:50,923 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:50,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:50,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:50,941 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2018-04-10 16:01:50,941 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 16:01:50,956 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:51,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2018-04-10 16:01:51,327 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:51,328 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 27 treesize of output 20 [2018-04-10 16:01:51,328 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:51,340 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:51,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:51,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:51,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:51,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:51,522 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:51,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 166 [2018-04-10 16:01:51,532 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:51,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 130 [2018-04-10 16:01:51,532 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:51,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:51,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:51,590 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 92 [2018-04-10 16:01:51,591 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:51,641 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 88 treesize of output 81 [2018-04-10 16:01:51,641 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:51,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:51,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:51,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 101 [2018-04-10 16:01:51,691 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:51,740 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:51,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 86 [2018-04-10 16:01:51,741 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:51,786 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:01:52,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:52,021 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:52,023 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 138 treesize of output 115 [2018-04-10 16:01:52,033 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:52,033 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 36 treesize of output 23 [2018-04-10 16:01:52,033 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:52,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:52,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:52,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 39 [2018-04-10 16:01:52,052 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 16:01:52,070 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 16:01:52,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:52,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:52,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:52,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 81 treesize of output 83 [2018-04-10 16:01:52,753 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 19 [2018-04-10 16:01:52,754 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:52,773 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 16:01:52,773 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:52,789 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:52,789 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 17 treesize of output 14 [2018-04-10 16:01:52,790 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:52,800 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:52,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:52,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:52,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:52,807 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 87 [2018-04-10 16:01:52,812 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 87 [2018-04-10 16:01:52,813 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:52,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:52,860 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:52,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:52,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-04-10 16:01:52,862 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:52,913 INFO L267 ElimStorePlain]: Start of recursive call 21: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:53,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:53,122 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:53,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:53,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:53,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:53,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 175 [2018-04-10 16:01:53,144 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:53,145 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 155 treesize of output 140 [2018-04-10 16:01:53,145 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:53,283 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 109 treesize of output 107 [2018-04-10 16:01:53,283 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:53,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:53,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:53,398 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 0 case distinctions, treesize of input 118 treesize of output 108 [2018-04-10 16:01:53,398 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:53,510 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 104 treesize of output 102 [2018-04-10 16:01:53,511 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:53,620 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 128 treesize of output 126 [2018-04-10 16:01:53,621 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:53,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 106 [2018-04-10 16:01:53,727 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:53,830 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 122 treesize of output 115 [2018-04-10 16:01:53,831 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:53,932 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:53,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:53,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 97 [2018-04-10 16:01:53,935 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:54,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:54,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:54,041 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 103 treesize of output 106 [2018-04-10 16:01:54,042 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:01:54,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:54,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:54,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 99 [2018-04-10 16:01:54,185 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:01:54,324 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:54,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:54,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:54,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:54,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:54,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:54,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:54,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 145 [2018-04-10 16:01:54,336 INFO L267 ElimStorePlain]: Start of recursive call 35: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:01:54,539 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:54,539 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 95 treesize of output 89 [2018-04-10 16:01:54,540 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:54,693 INFO L267 ElimStorePlain]: Start of recursive call 24: 12 dim-1 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2018-04-10 16:01:55,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:55,061 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 80 treesize of output 72 [2018-04-10 16:01:55,063 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:55,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-04-10 16:01:55,064 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:55,077 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:55,437 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 82 treesize of output 82 [2018-04-10 16:01:55,439 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:55,440 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 78 treesize of output 75 [2018-04-10 16:01:55,440 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:55,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2018-04-10 16:01:55,490 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:55,542 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:55,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:55,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:55,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 80 [2018-04-10 16:01:55,545 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:55,581 INFO L267 ElimStorePlain]: Start of recursive call 39: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:55,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2018-04-10 16:01:55,584 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 16:01:55,584 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:55,602 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:55,602 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 17 treesize of output 14 [2018-04-10 16:01:55,603 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:55,615 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:55,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 1 case distinctions, treesize of input 98 treesize of output 96 [2018-04-10 16:01:55,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 84 [2018-04-10 16:01:55,623 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:55,702 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 72 treesize of output 65 [2018-04-10 16:01:55,702 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:55,703 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 78 treesize of output 71 [2018-04-10 16:01:55,703 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:55,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:55,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:55,768 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 89 [2018-04-10 16:01:55,769 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 4 xjuncts. [2018-04-10 16:01:55,838 INFO L267 ElimStorePlain]: Start of recursive call 46: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:01:55,842 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 84 treesize of output 84 [2018-04-10 16:01:55,844 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 80 treesize of output 74 [2018-04-10 16:01:55,844 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:55,891 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 69 treesize of output 62 [2018-04-10 16:01:55,891 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:55,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:55,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:55,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 79 [2018-04-10 16:01:55,972 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:56,006 INFO L267 ElimStorePlain]: Start of recursive call 51: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:56,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 88 [2018-04-10 16:01:56,010 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:56,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 20 [2018-04-10 16:01:56,011 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:56,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:01:56,037 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:56,056 INFO L267 ElimStorePlain]: Start of recursive call 55: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:01:56,058 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 86 treesize of output 78 [2018-04-10 16:01:56,059 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 16:01:56,060 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:56,080 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:56,081 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 17 treesize of output 14 [2018-04-10 16:01:56,081 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:56,096 INFO L267 ElimStorePlain]: Start of recursive call 58: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:56,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:56,441 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:56,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:56,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:56,449 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 155 [2018-04-10 16:01:56,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:56,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:56,455 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:56,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:56,463 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 147 [2018-04-10 16:01:56,464 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 16:01:56,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:56,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:56,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 97 [2018-04-10 16:01:56,555 INFO L267 ElimStorePlain]: Start of recursive call 63: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-10 16:01:56,639 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 112 treesize of output 105 [2018-04-10 16:01:56,640 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:56,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:56,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:56,736 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 2 case distinctions, treesize of input 105 treesize of output 114 [2018-04-10 16:01:56,737 INFO L267 ElimStorePlain]: Start of recursive call 65: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-10 16:01:56,881 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:56,882 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 90 treesize of output 84 [2018-04-10 16:01:56,882 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:56,884 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:56,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 84 [2018-04-10 16:01:56,884 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:56,886 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:56,886 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 94 treesize of output 88 [2018-04-10 16:01:56,886 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:57,019 INFO L267 ElimStorePlain]: Start of recursive call 61: 5 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-04-10 16:01:57,521 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 77 treesize of output 75 [2018-04-10 16:01:57,523 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 71 treesize of output 63 [2018-04-10 16:01:57,524 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:57,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:57,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:57,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 62 [2018-04-10 16:01:57,582 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 3 xjuncts. [2018-04-10 16:01:57,654 INFO L267 ElimStorePlain]: Start of recursive call 69: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:01:57,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 71 [2018-04-10 16:01:57,657 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 16:01:57,658 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:57,672 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 23 treesize of output 18 [2018-04-10 16:01:57,673 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:57,691 INFO L267 ElimStorePlain]: Start of recursive call 72: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:01:57,693 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 85 treesize of output 75 [2018-04-10 16:01:57,694 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 16:01:57,694 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:57,712 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 23 treesize of output 18 [2018-04-10 16:01:57,713 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:57,732 INFO L267 ElimStorePlain]: Start of recursive call 75: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:01:57,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 73 [2018-04-10 16:01:57,735 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 17 treesize of output 14 [2018-04-10 16:01:57,736 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:57,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 16:01:57,752 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:57,764 INFO L267 ElimStorePlain]: Start of recursive call 78: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:57,769 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 77 treesize of output 77 [2018-04-10 16:01:57,770 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 73 treesize of output 66 [2018-04-10 16:01:57,771 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:57,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:57,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:57,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 66 [2018-04-10 16:01:57,815 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 2 xjuncts. [2018-04-10 16:01:57,853 INFO L267 ElimStorePlain]: Start of recursive call 81: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:57,858 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 81 treesize of output 79 [2018-04-10 16:01:57,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:57,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:57,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66 [2018-04-10 16:01:57,862 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 3 xjuncts. [2018-04-10 16:01:57,961 INFO L267 ElimStorePlain]: Start of recursive call 84: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:01:58,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:58,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:01:58,483 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:58,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 105 [2018-04-10 16:01:58,486 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:01:58,486 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 36 treesize of output 23 [2018-04-10 16:01:58,486 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:58,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2018-04-10 16:01:58,503 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:58,512 INFO L267 ElimStorePlain]: Start of recursive call 86: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:01:59,516 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 55 treesize of output 47 [2018-04-10 16:01:59,518 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 21 treesize of output 16 [2018-04-10 16:01:59,518 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-04-10 16:01:59,526 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:00,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:00,536 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:00,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 150 [2018-04-10 16:02:00,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:00,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:00,555 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 135 treesize of output 136 [2018-04-10 16:02:00,556 INFO L267 ElimStorePlain]: Start of recursive call 92: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:02:00,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:00,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:00,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 114 [2018-04-10 16:02:00,740 INFO L267 ElimStorePlain]: Start of recursive call 93: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:00,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:00,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:00,910 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:00,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 121 [2018-04-10 16:02:00,912 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:01,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 103 [2018-04-10 16:02:01,058 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:01,201 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:01,202 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 103 treesize of output 97 [2018-04-10 16:02:01,202 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:01,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:01,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:01,342 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 0 case distinctions, treesize of input 106 treesize of output 94 [2018-04-10 16:02:01,343 INFO L267 ElimStorePlain]: Start of recursive call 97: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:01,491 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:01,491 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 115 treesize of output 109 [2018-04-10 16:02:01,491 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:01,493 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:01,493 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 101 treesize of output 95 [2018-04-10 16:02:01,493 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:01,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:01,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:01,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:01,636 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:01,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:01,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:01,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:01,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:01,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 141 [2018-04-10 16:02:01,646 INFO L267 ElimStorePlain]: Start of recursive call 100: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:02:01,988 INFO L267 ElimStorePlain]: Start of recursive call 91: 8 dim-1 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2018-04-10 16:02:03,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:03,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:03,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:03,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 92 treesize of output 94 [2018-04-10 16:02:03,499 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2018-04-10 16:02:03,499 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:03,518 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 6 treesize of output 4 [2018-04-10 16:02:03,519 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:03,535 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 17 treesize of output 14 [2018-04-10 16:02:03,535 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:03,548 INFO L267 ElimStorePlain]: Start of recursive call 101: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:03,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:03,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:03,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:03,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 106 [2018-04-10 16:02:03,556 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 19 [2018-04-10 16:02:03,558 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:03,581 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 16:02:03,581 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:03,600 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 20 [2018-04-10 16:02:03,601 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 2 xjuncts. [2018-04-10 16:02:03,623 INFO L267 ElimStorePlain]: Start of recursive call 105: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:03,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:03,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:03,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:03,630 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 102 [2018-04-10 16:02:03,636 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 106 [2018-04-10 16:02:03,636 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:03,694 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 82 treesize of output 80 [2018-04-10 16:02:03,695 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:03,742 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 80 treesize of output 73 [2018-04-10 16:02:03,743 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:03,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-04-10 16:02:03,791 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:03,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:03,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:03,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 73 [2018-04-10 16:02:03,834 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 2 xjuncts. [2018-04-10 16:02:03,864 INFO L267 ElimStorePlain]: Start of recursive call 109: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:03,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:03,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:03,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:03,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 106 treesize of output 114 [2018-04-10 16:02:03,877 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 114 [2018-04-10 16:02:03,877 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:03,941 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 98 treesize of output 91 [2018-04-10 16:02:03,941 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:03,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-04-10 16:02:03,998 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 2 xjuncts. [2018-04-10 16:02:04,072 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 71 treesize of output 69 [2018-04-10 16:02:04,073 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:04,074 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 77 treesize of output 75 [2018-04-10 16:02:04,074 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:04,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:04,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:04,138 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2018-04-10 16:02:04,139 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 4 xjuncts. [2018-04-10 16:02:04,208 INFO L267 ElimStorePlain]: Start of recursive call 115: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:04,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:04,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:04,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:04,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 96 [2018-04-10 16:02:04,216 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2018-04-10 16:02:04,217 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:04,237 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 6 treesize of output 4 [2018-04-10 16:02:04,237 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:04,253 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 17 treesize of output 14 [2018-04-10 16:02:04,253 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:04,268 INFO L267 ElimStorePlain]: Start of recursive call 122: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:04,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:04,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:04,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:04,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 100 [2018-04-10 16:02:04,279 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 104 [2018-04-10 16:02:04,280 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:04,332 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 78 treesize of output 71 [2018-04-10 16:02:04,332 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:04,378 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 80 treesize of output 78 [2018-04-10 16:02:04,378 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:04,427 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 71 treesize of output 65 [2018-04-10 16:02:04,428 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:04,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:04,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:04,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 71 [2018-04-10 16:02:04,471 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 2 xjuncts. [2018-04-10 16:02:04,501 INFO L267 ElimStorePlain]: Start of recursive call 126: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:05,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 39 dim-0 vars, 22 dim-2 vars, End of recursive call: 42 dim-0 vars, and 31 xjuncts. [2018-04-10 16:02:05,195 INFO L202 ElimStorePlain]: Needed 131 recursive calls to eliminate 61 variables, input treesize:1653, output treesize:1073 [2018-04-10 16:02:05,443 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 334 DAG size of output 26 [2018-04-10 16:02:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:02:05,491 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:02:05,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-04-10 16:02:05,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 16:02:05,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 16:02:05,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=676, Unknown=1, NotChecked=0, Total=756 [2018-04-10 16:02:05,492 INFO L87 Difference]: Start difference. First operand 424 states and 494 transitions. Second operand 28 states. [2018-04-10 16:02:09,273 WARN L151 SmtUtils]: Spent 337ms on a formula simplification. DAG size of input: 171 DAG size of output 119 [2018-04-10 16:02:09,739 WARN L151 SmtUtils]: Spent 270ms on a formula simplification. DAG size of input: 410 DAG size of output 262 [2018-04-10 16:02:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:02:10,391 INFO L93 Difference]: Finished difference Result 465 states and 533 transitions. [2018-04-10 16:02:10,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 16:02:10,391 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 67 [2018-04-10 16:02:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:02:10,392 INFO L225 Difference]: With dead ends: 465 [2018-04-10 16:02:10,392 INFO L226 Difference]: Without dead ends: 438 [2018-04-10 16:02:10,392 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=141, Invalid=1264, Unknown=1, NotChecked=0, Total=1406 [2018-04-10 16:02:10,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-04-10 16:02:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 404. [2018-04-10 16:02:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-04-10 16:02:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 469 transitions. [2018-04-10 16:02:10,397 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 469 transitions. Word has length 67 [2018-04-10 16:02:10,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:02:10,397 INFO L459 AbstractCegarLoop]: Abstraction has 404 states and 469 transitions. [2018-04-10 16:02:10,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 16:02:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 469 transitions. [2018-04-10 16:02:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-10 16:02:10,397 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:02:10,397 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:02:10,398 INFO L408 AbstractCegarLoop]: === Iteration 58 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:02:10,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1965467507, now seen corresponding path program 1 times [2018-04-10 16:02:10,398 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:02:10,398 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:02:10,398 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:10,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:10,398 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:10,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:02:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:02:10,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:02:10,432 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:02:10,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:10,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:02:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:02:10,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:02:10,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-04-10 16:02:10,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:02:10,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:02:10,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:02:10,447 INFO L87 Difference]: Start difference. First operand 404 states and 469 transitions. Second operand 9 states. [2018-04-10 16:02:10,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:02:10,466 INFO L93 Difference]: Finished difference Result 416 states and 481 transitions. [2018-04-10 16:02:10,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:02:10,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-04-10 16:02:10,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:02:10,467 INFO L225 Difference]: With dead ends: 416 [2018-04-10 16:02:10,467 INFO L226 Difference]: Without dead ends: 416 [2018-04-10 16:02:10,467 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:02:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-04-10 16:02:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 411. [2018-04-10 16:02:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-04-10 16:02:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 476 transitions. [2018-04-10 16:02:10,471 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 476 transitions. Word has length 68 [2018-04-10 16:02:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:02:10,472 INFO L459 AbstractCegarLoop]: Abstraction has 411 states and 476 transitions. [2018-04-10 16:02:10,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:02:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 476 transitions. [2018-04-10 16:02:10,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-10 16:02:10,472 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:02:10,472 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 16:02:10,473 INFO L408 AbstractCegarLoop]: === Iteration 59 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:02:10,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1592487693, now seen corresponding path program 1 times [2018-04-10 16:02:10,473 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:02:10,473 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:02:10,473 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:10,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:10,474 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:10,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:02:10,486 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:02:10,486 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:02:10,486 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:02:10,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:10,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:02:10,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 6 treesize of output 5 [2018-04-10 16:02:10,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:10,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:10,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:02:10,575 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 16:02:10,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:10,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:10,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:10,585 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 16:02:10,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:27 [2018-04-10 16:02:10,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:10,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:10,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:02:10,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:10,654 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 16:02:10,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2018-04-10 16:02:10,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:10,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:10,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:10,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:10,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2018-04-10 16:02:10,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:11,027 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 0 case distinctions, treesize of input 46 treesize of output 50 [2018-04-10 16:02:11,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-10 16:02:11,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:11,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 16:02:11,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:11,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:11,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:11,048 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-04-10 16:02:11,050 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:11,051 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 39 treesize of output 32 [2018-04-10 16:02:11,051 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:11,058 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:11,063 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 16:02:11,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 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 16:02:11,084 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:106, output treesize:91 [2018-04-10 16:02:11,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2018-04-10 16:02:11,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:11,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:11,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:98, output treesize:52 [2018-04-10 16:02:11,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-04-10 16:02:11,459 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 26 treesize of output 20 [2018-04-10 16:02:11,460 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 16:02:11,463 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 16:02:11,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:11,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:126, output treesize:114 [2018-04-10 16:02:11,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:11,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:11,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:11,582 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:11,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:11,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 90 [2018-04-10 16:02:11,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:11,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:11,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:117, output treesize:73 [2018-04-10 16:02:11,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:11,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:11,652 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:11,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:11,656 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 46 treesize of output 69 [2018-04-10 16:02:11,658 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:11,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 47 [2018-04-10 16:02:11,658 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 16:02:11,664 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 16:02:11,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:11,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:81, output treesize:65 [2018-04-10 16:02:11,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:11,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-04-10 16:02:11,738 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:11,738 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 19 treesize of output 15 [2018-04-10 16:02:11,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:11,743 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:11,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 16:02:11,743 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:11,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:11,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:11,755 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:72, output treesize:25 [2018-04-10 16:02:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:02:11,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:02:11,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-10 16:02:11,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 16:02:11,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 16:02:11,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2018-04-10 16:02:11,821 INFO L87 Difference]: Start difference. First operand 411 states and 476 transitions. Second operand 30 states. [2018-04-10 16:02:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:02:12,902 INFO L93 Difference]: Finished difference Result 445 states and 516 transitions. [2018-04-10 16:02:12,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 16:02:12,902 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 73 [2018-04-10 16:02:12,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:02:12,903 INFO L225 Difference]: With dead ends: 445 [2018-04-10 16:02:12,903 INFO L226 Difference]: Without dead ends: 445 [2018-04-10 16:02:12,903 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=173, Invalid=1309, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 16:02:12,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-04-10 16:02:12,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 423. [2018-04-10 16:02:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-04-10 16:02:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 490 transitions. [2018-04-10 16:02:12,907 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 490 transitions. Word has length 73 [2018-04-10 16:02:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:02:12,907 INFO L459 AbstractCegarLoop]: Abstraction has 423 states and 490 transitions. [2018-04-10 16:02:12,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 16:02:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 490 transitions. [2018-04-10 16:02:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-10 16:02:12,907 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:02:12,908 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 16:02:12,908 INFO L408 AbstractCegarLoop]: === Iteration 60 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:02:12,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1592487694, now seen corresponding path program 1 times [2018-04-10 16:02:12,908 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:02:12,908 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:02:12,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:12,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:12,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:12,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:02:12,919 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:02:12,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:02:12,920 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:02:12,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:12,958 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:02:12,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, 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 16:02:12,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:12,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:12,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:12,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:12,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:02:13,035 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 16:02:13,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:13,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,058 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 16:02:13,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:13,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,061 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,071 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 16:02:13,071 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:50, output treesize:44 [2018-04-10 16:02:13,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:13,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:13,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 16:02:13,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:13,098 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 29 [2018-04-10 16:02:13,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,108 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 16:02:13,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:42 [2018-04-10 16:02:13,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:13,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-04-10 16:02:13,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 16:02:13,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,301 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 16:02:13,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:59 [2018-04-10 16:02:13,613 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 63 DAG size of output 62 [2018-04-10 16:02:13,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:13,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:13,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2018-04-10 16:02:13,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:02:13,746 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 0 case distinctions, treesize of input 65 treesize of output 55 [2018-04-10 16:02:13,748 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:13,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:13,749 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 44 treesize of output 48 [2018-04-10 16:02:13,752 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 41 treesize of output 42 [2018-04-10 16:02:13,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,775 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 27 [2018-04-10 16:02:13,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:13,777 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:13,778 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 27 treesize of output 36 [2018-04-10 16:02:13,778 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,784 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,792 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 16:02:13,794 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:02:13,794 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2018-04-10 16:02:13,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-10 16:02:13,804 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 19 [2018-04-10 16:02:13,804 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,808 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:13,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-04-10 16:02:13,835 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:13,837 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 20 [2018-04-10 16:02:13,837 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,844 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,853 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,895 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 0 case distinctions, treesize of input 54 treesize of output 44 [2018-04-10 16:02:13,898 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:13,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:13,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 49 [2018-04-10 16:02:13,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-04-10 16:02:13,901 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,908 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,915 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 33 treesize of output 24 [2018-04-10 16:02:13,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:13,917 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:13,919 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:13,919 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 24 treesize of output 36 [2018-04-10 16:02:13,919 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,923 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,927 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,930 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 45 treesize of output 45 [2018-04-10 16:02:13,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16:02:13,934 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 19 [2018-04-10 16:02:13,935 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,938 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,946 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:13,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2018-04-10 16:02:13,949 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:13,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-04-10 16:02:13,950 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,955 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,960 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:13,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-10 16:02:13,997 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:133, output treesize:224 [2018-04-10 16:02:14,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:14,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:14,631 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 106 treesize of output 119 [2018-04-10 16:02:14,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:14,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:14,633 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 100 treesize of output 94 [2018-04-10 16:02:14,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:14,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:14,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:207, output treesize:200 [2018-04-10 16:02:14,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:14,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:14,737 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 121 treesize of output 115 [2018-04-10 16:02:14,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:14,738 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:02:14,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:14,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:14,773 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:14,774 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 77 treesize of output 93 [2018-04-10 16:02:14,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 114 [2018-04-10 16:02:14,776 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:14,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:14,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:14,793 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 96 treesize of output 84 [2018-04-10 16:02:14,794 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 83 treesize of output 64 [2018-04-10 16:02:14,795 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:14,800 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:14,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:14,807 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:237, output treesize:68 [2018-04-10 16:02:14,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:14,850 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 34 treesize of output 30 [2018-04-10 16:02:14,851 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:14,852 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 16:02:14,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:14,856 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 5 [2018-04-10 16:02:14,856 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:14,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:14,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:14,863 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 36 treesize of output 28 [2018-04-10 16:02:14,864 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:14,865 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 19 treesize of output 5 [2018-04-10 16:02:14,865 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:14,872 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 16:02:14,872 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:14,873 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:14,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:14,877 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:79, output treesize:19 [2018-04-10 16:02:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:02:14,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:02:14,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-10 16:02:14,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 16:02:14,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 16:02:14,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=840, Unknown=1, NotChecked=0, Total=930 [2018-04-10 16:02:14,970 INFO L87 Difference]: Start difference. First operand 423 states and 490 transitions. Second operand 31 states. [2018-04-10 16:02:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:02:17,144 INFO L93 Difference]: Finished difference Result 505 states and 586 transitions. [2018-04-10 16:02:17,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 16:02:17,145 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 73 [2018-04-10 16:02:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:02:17,146 INFO L225 Difference]: With dead ends: 505 [2018-04-10 16:02:17,146 INFO L226 Difference]: Without dead ends: 505 [2018-04-10 16:02:17,146 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=177, Invalid=1627, Unknown=2, NotChecked=0, Total=1806 [2018-04-10 16:02:17,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-04-10 16:02:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 452. [2018-04-10 16:02:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-04-10 16:02:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 524 transitions. [2018-04-10 16:02:17,149 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 524 transitions. Word has length 73 [2018-04-10 16:02:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:02:17,149 INFO L459 AbstractCegarLoop]: Abstraction has 452 states and 524 transitions. [2018-04-10 16:02:17,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 16:02:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 524 transitions. [2018-04-10 16:02:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-10 16:02:17,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:02:17,150 INFO L355 BasicCegarLoop]: trace histogram [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, 1] [2018-04-10 16:02:17,150 INFO L408 AbstractCegarLoop]: === Iteration 61 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:02:17,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1800654819, now seen corresponding path program 1 times [2018-04-10 16:02:17,150 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:02:17,150 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:02:17,151 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:17,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:17,151 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:17,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:02:17,161 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:02:17,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:02:17,161 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:02:17,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:17,202 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:02:17,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:17,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:17,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:17,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:02:17,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:02:17,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:02:17,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:17,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:17,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:02:17,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:17,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:17,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:17,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:17,235 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-04-10 16:02:17,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:17,870 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 155 treesize of output 89 [2018-04-10 16:02:17,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 10 treesize of output 9 [2018-04-10 16:02:17,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:17,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:17,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:17,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:17,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 66 [2018-04-10 16:02:17,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:17,947 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:17,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:17,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:17,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 55 [2018-04-10 16:02:18,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,008 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 16:02:18,009 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:18,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 85 [2018-04-10 16:02:18,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,098 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:18,103 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 60 treesize of output 71 [2018-04-10 16:02:18,104 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:18,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-04-10 16:02:18,356 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:18,399 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:18,437 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:18,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:18,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:18,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,607 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 155 treesize of output 89 [2018-04-10 16:02:18,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:02:18,610 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:18,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 66 [2018-04-10 16:02:18,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:18,640 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:18,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 53 treesize of output 64 [2018-04-10 16:02:18,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,669 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 25 treesize of output 31 [2018-04-10 16:02:18,670 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:18,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,720 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 103 [2018-04-10 16:02:18,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 88 [2018-04-10 16:02:18,724 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:18,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,807 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:18,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:18,811 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 40 treesize of output 55 [2018-04-10 16:02:18,811 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:18,849 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:18,850 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 42 treesize of output 39 [2018-04-10 16:02:18,850 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:18,880 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:02:18,910 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:02:18,939 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:02:18,968 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:02:19,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 5 xjuncts. [2018-04-10 16:02:19,053 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 11 variables, input treesize:399, output treesize:896 [2018-04-10 16:02:19,528 WARN L151 SmtUtils]: Spent 355ms on a formula simplification. DAG size of input: 205 DAG size of output 133 [2018-04-10 16:02:20,068 WARN L151 SmtUtils]: Spent 423ms on a formula simplification. DAG size of input: 139 DAG size of output 137 [2018-04-10 16:02:20,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:20,164 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 134 [2018-04-10 16:02:20,166 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:20,166 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 114 treesize of output 101 [2018-04-10 16:02:20,166 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 16:02:20,180 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 16:02:20,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:20,189 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 16:02:20,214 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 16:02:20,214 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:206, output treesize:142 [2018-04-10 16:02:20,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:20,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:20,381 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 43 treesize of output 60 [2018-04-10 16:02:20,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:20,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:20,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:20,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-04-10 16:02:20,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:20,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:20,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:20,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:108, output treesize:91 [2018-04-10 16:02:21,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:21,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:21,192 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:21,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:21,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:21,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:21,195 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:21,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:21,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 164 [2018-04-10 16:02:21,203 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:21,203 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 59 treesize of output 53 [2018-04-10 16:02:21,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:21,222 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:21,223 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 46 treesize of output 41 [2018-04-10 16:02:21,223 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 16:02:21,236 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:21,237 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 55 treesize of output 45 [2018-04-10 16:02:21,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:21,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:21,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:21,264 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:237, output treesize:61 [2018-04-10 16:02:21,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:02:21,790 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:02:21,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-10 16:02:21,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 16:02:21,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 16:02:21,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1236, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 16:02:21,790 INFO L87 Difference]: Start difference. First operand 452 states and 524 transitions. Second operand 37 states. [2018-04-10 16:02:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:02:26,407 INFO L93 Difference]: Finished difference Result 464 states and 538 transitions. [2018-04-10 16:02:26,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 16:02:26,408 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-04-10 16:02:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:02:26,409 INFO L225 Difference]: With dead ends: 464 [2018-04-10 16:02:26,409 INFO L226 Difference]: Without dead ends: 427 [2018-04-10 16:02:26,409 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=256, Invalid=3650, Unknown=0, NotChecked=0, Total=3906 [2018-04-10 16:02:26,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-04-10 16:02:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 419. [2018-04-10 16:02:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-04-10 16:02:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 490 transitions. [2018-04-10 16:02:26,412 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 490 transitions. Word has length 72 [2018-04-10 16:02:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:02:26,412 INFO L459 AbstractCegarLoop]: Abstraction has 419 states and 490 transitions. [2018-04-10 16:02:26,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 16:02:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 490 transitions. [2018-04-10 16:02:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-10 16:02:26,413 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:02:26,413 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 16:02:26,413 INFO L408 AbstractCegarLoop]: === Iteration 62 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:02:26,413 INFO L82 PathProgramCache]: Analyzing trace with hash -295738021, now seen corresponding path program 1 times [2018-04-10 16:02:26,413 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:02:26,413 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:02:26,413 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:26,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:26,414 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:26,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:02:26,432 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:02:26,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:02:26,432 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:02:26,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:26,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:02:26,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:26,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:26,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:26,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-10 16:02:26,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:26,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:26,563 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 17 treesize of output 24 [2018-04-10 16:02:26,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:26,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:26,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 16:02:26,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:02:26,582 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 16:02:26,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:26,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:26,589 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 16:02:26,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-10 16:02:26,605 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 16:02:26,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 16:02:26,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:26,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:26,621 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 29 treesize of output 39 [2018-04-10 16:02:26,626 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 25 treesize of output 31 [2018-04-10 16:02:26,627 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:02:26,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 25 [2018-04-10 16:02:26,645 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:26,655 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 16:02:26,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:02:26,666 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:87 [2018-04-10 16:02:26,757 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 66 treesize of output 62 [2018-04-10 16:02:26,758 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 16:02:26,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:26,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:26,777 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 51 treesize of output 47 [2018-04-10 16:02:26,778 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 16:02:26,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:26,784 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:26,800 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 2 xjuncts. [2018-04-10 16:02:26,800 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:118, output treesize:96 [2018-04-10 16:02:26,829 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2018-04-10 16:02:26,830 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:26,830 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 24 treesize of output 16 [2018-04-10 16:02:26,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:26,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:26,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:26,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:26,850 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 62 treesize of output 55 [2018-04-10 16:02:26,853 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:26,856 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2018-04-10 16:02:26,856 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:02:26,867 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 28 treesize of output 22 [2018-04-10 16:02:26,867 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 16:02:26,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:26,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:02:26,882 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:110, output treesize:31 [2018-04-10 16:02:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-10 16:02:26,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:02:26,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 16:02:26,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:02:26,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:02:26,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:02:26,963 INFO L87 Difference]: Start difference. First operand 419 states and 490 transitions. Second operand 21 states. [2018-04-10 16:02:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:02:27,911 INFO L93 Difference]: Finished difference Result 471 states and 552 transitions. [2018-04-10 16:02:27,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:02:27,911 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 74 [2018-04-10 16:02:27,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:02:27,912 INFO L225 Difference]: With dead ends: 471 [2018-04-10 16:02:27,912 INFO L226 Difference]: Without dead ends: 471 [2018-04-10 16:02:27,912 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=1288, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 16:02:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-04-10 16:02:27,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 419. [2018-04-10 16:02:27,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-04-10 16:02:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 488 transitions. [2018-04-10 16:02:27,916 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 488 transitions. Word has length 74 [2018-04-10 16:02:27,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:02:27,916 INFO L459 AbstractCegarLoop]: Abstraction has 419 states and 488 transitions. [2018-04-10 16:02:27,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:02:27,916 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 488 transitions. [2018-04-10 16:02:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-10 16:02:27,916 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:02:27,916 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 16:02:27,916 INFO L408 AbstractCegarLoop]: === Iteration 63 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:02:27,916 INFO L82 PathProgramCache]: Analyzing trace with hash -295738020, now seen corresponding path program 1 times [2018-04-10 16:02:27,917 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:02:27,917 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:02:27,917 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:27,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:27,917 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:27,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:02:27,933 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:02:27,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:02:27,933 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:02:27,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:27,998 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:02:28,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:28,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:02:28,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:28,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:28,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:28,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:28,124 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 25 treesize of output 51 [2018-04-10 16:02:28,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-04-10 16:02:28,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,136 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 16:02:28,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:31 [2018-04-10 16:02:28,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:28,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:02:28,364 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 16:02:28,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 8 treesize of output 7 [2018-04-10 16:02:28,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 16:02:28,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:02:28,380 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,390 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 16:02:28,390 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-04-10 16:02:28,438 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 16:02:28,445 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 16:02:28,446 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 16:02:28,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:28,464 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,474 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 16:02:28,497 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 16:02:28,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:28,499 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,509 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,523 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 16:02:28,523 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:50, output treesize:91 [2018-04-10 16:02:28,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:28,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:28,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:28,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:28,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 92 [2018-04-10 16:02:28,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:28,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:140, output treesize:49 [2018-04-10 16:02:28,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:28,669 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:28,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 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 16:02:28,672 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:28,673 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 38 treesize of output 22 [2018-04-10 16:02:28,673 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 16:02:28,680 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:28,680 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 16:02:28,680 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,684 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 16:02:28,695 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 16:02:28,697 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:28,697 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 16:02:28,697 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,702 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 16:02:28,702 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,705 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:28,711 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 16:02:28,711 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:81, output treesize:9 [2018-04-10 16:02:28,766 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-10 16:02:28,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:02:28,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-10 16:02:28,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 16:02:28,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 16:02:28,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2018-04-10 16:02:28,767 INFO L87 Difference]: Start difference. First operand 419 states and 488 transitions. Second operand 22 states. [2018-04-10 16:02:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:02:31,031 INFO L93 Difference]: Finished difference Result 467 states and 538 transitions. [2018-04-10 16:02:31,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 16:02:31,031 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 74 [2018-04-10 16:02:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:02:31,033 INFO L225 Difference]: With dead ends: 467 [2018-04-10 16:02:31,033 INFO L226 Difference]: Without dead ends: 466 [2018-04-10 16:02:31,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=182, Invalid=1624, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 16:02:31,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-04-10 16:02:31,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 391. [2018-04-10 16:02:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-04-10 16:02:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 450 transitions. [2018-04-10 16:02:31,039 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 450 transitions. Word has length 74 [2018-04-10 16:02:31,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:02:31,039 INFO L459 AbstractCegarLoop]: Abstraction has 391 states and 450 transitions. [2018-04-10 16:02:31,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 16:02:31,039 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 450 transitions. [2018-04-10 16:02:31,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-10 16:02:31,040 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:02:31,040 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 16:02:31,040 INFO L408 AbstractCegarLoop]: === Iteration 64 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:02:31,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1371391946, now seen corresponding path program 1 times [2018-04-10 16:02:31,041 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:02:31,041 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:02:31,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:31,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:31,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:31,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:02:31,054 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:02:31,054 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:02:31,054 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:02:31,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:31,098 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:02:31,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:31,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:31,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:31,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:31,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:31,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:02:31,184 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 16:02:31,186 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 16:02:31,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:31,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:31,198 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 16:02:31,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:44 [2018-04-10 16:02:31,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:31,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:31,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 29 [2018-04-10 16:02:31,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:31,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:31,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:31,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-04-10 16:02:31,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:31,248 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 16:02:31,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:46 [2018-04-10 16:02:31,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:31,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:31,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:31,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:31,523 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-10 16:02:31,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:31,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:31,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:31,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-10 16:02:31,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:31,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-04-10 16:02:31,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16:02:31,556 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 19 [2018-04-10 16:02:31,557 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:31,560 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:31,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:31,570 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-04-10 16:02:31,572 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:31,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-04-10 16:02:31,572 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:31,579 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:31,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:31,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:31,594 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:105, output treesize:55 [2018-04-10 16:02:31,846 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 16:02:31,847 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 26 treesize of output 20 [2018-04-10 16:02:31,847 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 16:02:31,851 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 16:02:31,859 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 16:02:31,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:71 [2018-04-10 16:02:31,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:31,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-04-10 16:02:31,958 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 69 treesize of output 52 [2018-04-10 16:02:31,959 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 16:02:31,965 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 16:02:31,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:31,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:51 [2018-04-10 16:02:32,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-04-10 16:02:32,018 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:32,018 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 28 treesize of output 24 [2018-04-10 16:02:32,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:32,024 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-04-10 16:02:32,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:32,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:32,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:32,032 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:55, output treesize:4 [2018-04-10 16:02:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:02:32,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:02:32,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-10 16:02:32,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 16:02:32,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 16:02:32,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2018-04-10 16:02:32,069 INFO L87 Difference]: Start difference. First operand 391 states and 450 transitions. Second operand 30 states. [2018-04-10 16:02:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:02:34,143 INFO L93 Difference]: Finished difference Result 418 states and 477 transitions. [2018-04-10 16:02:34,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 16:02:34,144 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 75 [2018-04-10 16:02:34,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:02:34,145 INFO L225 Difference]: With dead ends: 418 [2018-04-10 16:02:34,145 INFO L226 Difference]: Without dead ends: 418 [2018-04-10 16:02:34,145 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=238, Invalid=2212, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 16:02:34,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-04-10 16:02:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 391. [2018-04-10 16:02:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-04-10 16:02:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 448 transitions. [2018-04-10 16:02:34,149 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 448 transitions. Word has length 75 [2018-04-10 16:02:34,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:02:34,149 INFO L459 AbstractCegarLoop]: Abstraction has 391 states and 448 transitions. [2018-04-10 16:02:34,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 16:02:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 448 transitions. [2018-04-10 16:02:34,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-10 16:02:34,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:02:34,150 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 16:02:34,150 INFO L408 AbstractCegarLoop]: === Iteration 65 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:02:34,150 INFO L82 PathProgramCache]: Analyzing trace with hash -946581487, now seen corresponding path program 1 times [2018-04-10 16:02:34,150 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:02:34,151 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:02:34,151 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:34,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:34,151 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:34,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:02:34,161 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:02:34,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:02:34,162 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:02:34,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:34,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:02:34,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:34,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:34,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:34,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:34,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:34,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:02:34,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,324 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 15 treesize of output 27 [2018-04-10 16:02:34,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-04-10 16:02:34,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:34,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:34,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,343 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 25 treesize of output 51 [2018-04-10 16:02:34,344 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 30 treesize of output 37 [2018-04-10 16:02:34,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:34,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:34,356 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 16:02:34,356 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:38 [2018-04-10 16:02:34,419 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 16:02:34,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:02:34,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:34,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:34,427 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 16:02:34,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:40 [2018-04-10 16:02:34,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,490 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 35 treesize of output 70 [2018-04-10 16:02:34,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:34,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,517 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 23 treesize of output 16 [2018-04-10 16:02:34,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:34,528 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 16:02:34,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:70 [2018-04-10 16:02:34,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-04-10 16:02:34,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:34,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:34,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:70, output treesize:18 [2018-04-10 16:02:34,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 41 treesize of output 31 [2018-04-10 16:02:34,648 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:34,648 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 31 treesize of output 21 [2018-04-10 16:02:34,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:34,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:34,662 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 16:02:34,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:45 [2018-04-10 16:02:34,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:34,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2018-04-10 16:02:34,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:34,700 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 16:02:34,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:33 [2018-04-10 16:02:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-10 16:02:34,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:02:34,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 16:02:34,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 16:02:34,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 16:02:34,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-04-10 16:02:34,739 INFO L87 Difference]: Start difference. First operand 391 states and 448 transitions. Second operand 19 states. [2018-04-10 16:02:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:02:36,620 INFO L93 Difference]: Finished difference Result 437 states and 503 transitions. [2018-04-10 16:02:36,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 16:02:36,620 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-04-10 16:02:36,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:02:36,621 INFO L225 Difference]: With dead ends: 437 [2018-04-10 16:02:36,621 INFO L226 Difference]: Without dead ends: 437 [2018-04-10 16:02:36,622 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2018-04-10 16:02:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-04-10 16:02:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 391. [2018-04-10 16:02:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-04-10 16:02:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 448 transitions. [2018-04-10 16:02:36,626 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 448 transitions. Word has length 75 [2018-04-10 16:02:36,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:02:36,626 INFO L459 AbstractCegarLoop]: Abstraction has 391 states and 448 transitions. [2018-04-10 16:02:36,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 16:02:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 448 transitions. [2018-04-10 16:02:36,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-10 16:02:36,627 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:02:36,627 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 16:02:36,627 INFO L408 AbstractCegarLoop]: === Iteration 66 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:02:36,627 INFO L82 PathProgramCache]: Analyzing trace with hash -407829837, now seen corresponding path program 1 times [2018-04-10 16:02:36,627 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:02:36,628 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:02:36,628 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:36,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:36,628 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:36,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:02:36,639 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:02:36,639 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:02:36,640 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:02:36,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:36,691 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:02:36,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 6 treesize of output 5 [2018-04-10 16:02:36,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:36,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:36,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:02:36,745 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 16:02:36,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:02:36,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:36,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:36,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:36,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-04-10 16:02:36,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:36,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:36,777 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 17 treesize of output 24 [2018-04-10 16:02:36,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:36,782 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 16:02:36,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-10 16:02:36,969 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 16:02:36,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:36,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:36,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:36,978 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 16:02:36,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:70 [2018-04-10 16:02:37,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:37,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:37,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:37,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-10 16:02:37,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:37,053 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 42 treesize of output 46 [2018-04-10 16:02:37,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16:02:37,057 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 27 [2018-04-10 16:02:37,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:37,061 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:37,070 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:37,070 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-04-10 16:02:37,072 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 27 treesize of output 27 [2018-04-10 16:02:37,072 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:37,077 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:37,081 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 16:02:37,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:37,089 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:94, output treesize:38 [2018-04-10 16:02:37,321 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 16:02:37,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:37,332 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 85 treesize of output 75 [2018-04-10 16:02:37,333 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 72 treesize of output 61 [2018-04-10 16:02:37,334 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 16:02:37,346 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:37,353 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:37,354 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 57 treesize of output 65 [2018-04-10 16:02:37,355 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 54 treesize of output 70 [2018-04-10 16:02:37,355 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:37,360 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:37,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:37,364 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:93, output treesize:53 [2018-04-10 16:02:37,460 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 40 treesize of output 36 [2018-04-10 16:02:37,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 1 [2018-04-10 16:02:37,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:37,465 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 19 treesize of output 11 [2018-04-10 16:02:37,465 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:37,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:37,472 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 47 treesize of output 37 [2018-04-10 16:02:37,473 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:37,473 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 19 treesize of output 5 [2018-04-10 16:02:37,473 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:37,477 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 20 treesize of output 11 [2018-04-10 16:02:37,477 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:37,478 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:37,481 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 16:02:37,481 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:79, output treesize:11 [2018-04-10 16:02:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:02:37,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:02:37,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-10 16:02:37,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 16:02:37,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 16:02:37,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=676, Unknown=3, NotChecked=0, Total=756 [2018-04-10 16:02:37,515 INFO L87 Difference]: Start difference. First operand 391 states and 448 transitions. Second operand 28 states. [2018-04-10 16:02:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:02:39,303 INFO L93 Difference]: Finished difference Result 442 states and 504 transitions. [2018-04-10 16:02:39,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 16:02:39,304 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 76 [2018-04-10 16:02:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:02:39,305 INFO L225 Difference]: With dead ends: 442 [2018-04-10 16:02:39,305 INFO L226 Difference]: Without dead ends: 442 [2018-04-10 16:02:39,305 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=248, Invalid=2292, Unknown=10, NotChecked=0, Total=2550 [2018-04-10 16:02:39,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-04-10 16:02:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 394. [2018-04-10 16:02:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-04-10 16:02:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 451 transitions. [2018-04-10 16:02:39,309 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 451 transitions. Word has length 76 [2018-04-10 16:02:39,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:02:39,309 INFO L459 AbstractCegarLoop]: Abstraction has 394 states and 451 transitions. [2018-04-10 16:02:39,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 16:02:39,309 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 451 transitions. [2018-04-10 16:02:39,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-10 16:02:39,309 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:02:39,309 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:02:39,309 INFO L408 AbstractCegarLoop]: === Iteration 67 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:02:39,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1144095708, now seen corresponding path program 2 times [2018-04-10 16:02:39,310 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:02:39,310 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:02:39,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:39,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:39,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:39,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:02:39,340 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:02:39,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:02:39,341 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:02:39,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:02:39,346 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-10 16:02:39,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:02:39,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:02:39,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:39,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:39,540 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 16:02:39,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:39,546 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 16:02:39,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:39,555 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 16:02:39,555 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-10 16:02:39,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:39,578 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 16:02:39,578 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:46 [2018-04-10 16:02:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-04-10 16:02:39,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:02:39,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2018-04-10 16:02:39,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 16:02:39,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 16:02:39,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:02:39,635 INFO L87 Difference]: Start difference. First operand 394 states and 451 transitions. Second operand 16 states. [2018-04-10 16:02:40,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:02:40,805 INFO L93 Difference]: Finished difference Result 411 states and 468 transitions. [2018-04-10 16:02:40,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 16:02:40,805 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-04-10 16:02:40,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:02:40,806 INFO L225 Difference]: With dead ends: 411 [2018-04-10 16:02:40,806 INFO L226 Difference]: Without dead ends: 411 [2018-04-10 16:02:40,806 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2018-04-10 16:02:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-04-10 16:02:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 400. [2018-04-10 16:02:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-04-10 16:02:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 457 transitions. [2018-04-10 16:02:40,809 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 457 transitions. Word has length 75 [2018-04-10 16:02:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:02:40,809 INFO L459 AbstractCegarLoop]: Abstraction has 400 states and 457 transitions. [2018-04-10 16:02:40,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 16:02:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 457 transitions. [2018-04-10 16:02:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-10 16:02:40,810 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:02:40,810 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 16:02:40,810 INFO L408 AbstractCegarLoop]: === Iteration 68 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:02:40,811 INFO L82 PathProgramCache]: Analyzing trace with hash -848381854, now seen corresponding path program 1 times [2018-04-10 16:02:40,811 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:02:40,811 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:02:40,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:40,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:02:40,812 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:02:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:40,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:02:40,829 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:02:40,829 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:02:40,829 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:02:40,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:02:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:02:40,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:02:40,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:40,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:40,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:02:40,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:40,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:40,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:02:40,905 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 16:02:40,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:02:40,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:40,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:40,912 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 16:02:40,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 16:02:40,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:40,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:40,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:40,918 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-10 16:02:41,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:41,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:41,312 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 16:02:41,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:41,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:41,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:41,396 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 16:02:41,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:41,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:41,483 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 39 treesize of output 41 [2018-04-10 16:02:41,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 26 [2018-04-10 16:02:41,489 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 26 [2018-04-10 16:02:41,489 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:41,494 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:41,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:41,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-04-10 16:02:41,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 30 [2018-04-10 16:02:41,522 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-10 16:02:41,546 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:02:41,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:02:41,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:41,587 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 1 case distinctions, treesize of input 34 treesize of output 38 [2018-04-10 16:02:41,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16:02:41,592 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 16:02:41,593 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:41,597 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:41,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:41,624 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 33 treesize of output 53 [2018-04-10 16:02:41,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-04-10 16:02:41,651 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:41,684 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:41,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-04-10 16:02:41,685 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:41,702 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:41,731 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:41,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:41,810 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 39 treesize of output 41 [2018-04-10 16:02:41,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 26 [2018-04-10 16:02:41,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 26 [2018-04-10 16:02:41,815 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:41,819 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:41,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:41,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-04-10 16:02:41,836 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 19 treesize of output 26 [2018-04-10 16:02:41,837 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-04-10 16:02:41,847 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:41,863 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:41,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:41,872 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 1 case distinctions, treesize of input 34 treesize of output 38 [2018-04-10 16:02:41,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-04-10 16:02:41,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-04-10 16:02:41,876 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:41,880 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:41,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:41,900 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 33 treesize of output 53 [2018-04-10 16:02:41,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-04-10 16:02:41,902 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:41,920 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:41,927 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:41,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-04-10 16:02:41,985 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 9 variables, input treesize:121, output treesize:368 [2018-04-10 16:02:42,250 WARN L151 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 106 DAG size of output 80 [2018-04-10 16:02:46,529 WARN L151 SmtUtils]: Spent 3888ms on a formula simplification. DAG size of input: 209 DAG size of output 165 [2018-04-10 16:02:46,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:46,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:46,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:46,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:46,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 112 [2018-04-10 16:02:46,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:47,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:47,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:47,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:47,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:47,546 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 148 treesize of output 186 [2018-04-10 16:02:47,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:02:49,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:49,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:49,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:49,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:49,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 165 [2018-04-10 16:02:49,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:50,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:50,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:50,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:50,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:50,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 148 [2018-04-10 16:02:50,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:50,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:50,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:50,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:50,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:50,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 144 [2018-04-10 16:02:50,623 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:51,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:51,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:51,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 119 [2018-04-10 16:02:51,860 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:53,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:53,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:53,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:53,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:53,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 134 [2018-04-10 16:02:53,128 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:54,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:54,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:54,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 150 [2018-04-10 16:02:54,418 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 0 case distinctions, treesize of input 21 treesize of output 34 [2018-04-10 16:02:54,427 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 27 treesize of output 34 [2018-04-10 16:02:54,428 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-10 16:02:54,443 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:54,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:54,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:54,489 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:54,490 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 59 treesize of output 70 [2018-04-10 16:02:54,492 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 32 treesize of output 30 [2018-04-10 16:02:54,492 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:54,501 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:54,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:54,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:54,508 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:54,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64 [2018-04-10 16:02:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 16:02:54,511 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:54,520 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:54,551 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:54,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:54,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:54,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, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 136 treesize of output 163 [2018-04-10 16:02:54,590 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 0 case distinctions, treesize of input 149 treesize of output 155 [2018-04-10 16:02:54,600 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 27 treesize of output 34 [2018-04-10 16:02:54,600 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-04-10 16:02:54,646 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:54,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 142 [2018-04-10 16:02:54,879 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 19 [2018-04-10 16:02:54,879 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:54,907 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:55,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:55,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:55,172 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:55,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 138 treesize of output 152 [2018-04-10 16:02:55,188 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 147 treesize of output 139 [2018-04-10 16:02:55,189 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:55,233 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:55,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:55,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:55,369 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:55,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 155 [2018-04-10 16:02:55,385 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 148 treesize of output 144 [2018-04-10 16:02:55,385 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:55,431 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:55,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:55,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:55,509 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:55,512 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 128 treesize of output 133 [2018-04-10 16:02:55,514 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 23 treesize of output 19 [2018-04-10 16:02:55,514 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:55,539 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:55,592 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:56,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:56,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:56,346 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 103 treesize of output 111 [2018-04-10 16:02:56,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16:02:56,350 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 19 [2018-04-10 16:02:56,351 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:56,354 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:56,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:56,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:56,383 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:56,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2018-04-10 16:02:56,388 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 23 treesize of output 19 [2018-04-10 16:02:56,388 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:56,396 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:56,410 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 16:02:56,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:56,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:56,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 133 [2018-04-10 16:02:56,801 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 54 [2018-04-10 16:02:56,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 57 [2018-04-10 16:02:56,810 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:02:56,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-04-10 16:02:56,841 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:56,869 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 16:02:56,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:56,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:56,923 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 63 treesize of output 64 [2018-04-10 16:02:56,925 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 23 treesize of output 19 [2018-04-10 16:02:56,925 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:56,934 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:56,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:56,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:56,941 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 76 treesize of output 84 [2018-04-10 16:02:56,943 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 23 treesize of output 19 [2018-04-10 16:02:56,943 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:56,951 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:56,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:56,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:56,958 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 63 treesize of output 64 [2018-04-10 16:02:56,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 16:02:56,960 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:56,969 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:57,007 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 16:02:57,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:57,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:57,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 128 treesize of output 150 [2018-04-10 16:02:57,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 144 treesize of output 146 [2018-04-10 16:02:57,034 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 19 [2018-04-10 16:02:57,034 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:57,059 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:57,178 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 126 [2018-04-10 16:02:57,181 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 120 treesize of output 121 [2018-04-10 16:02:57,181 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:57,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 129 [2018-04-10 16:02:57,250 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:02:57,337 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 16:02:57,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:57,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:57,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 135 treesize of output 150 [2018-04-10 16:02:57,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 140 [2018-04-10 16:02:57,559 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:57,629 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:57,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 119 [2018-04-10 16:02:57,630 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:57,676 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:02:57,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:57,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:57,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 105 [2018-04-10 16:02:57,863 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 23 treesize of output 19 [2018-04-10 16:02:57,863 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:57,879 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:57,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:57,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:57,885 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 134 treesize of output 142 [2018-04-10 16:02:57,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 16:02:57,888 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:57,908 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:57,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:57,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:57,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 112 [2018-04-10 16:02:57,921 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 23 treesize of output 19 [2018-04-10 16:02:57,921 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:57,938 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:58,115 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 16:02:58,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:58,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:58,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 128 [2018-04-10 16:02:58,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:58,127 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 89 [2018-04-10 16:02:58,131 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 85 treesize of output 69 [2018-04-10 16:02:58,131 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:58,141 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:58,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:58,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:58,166 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 48 treesize of output 51 [2018-04-10 16:02:58,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 30 [2018-04-10 16:02:58,168 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:58,174 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:58,189 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:02:58,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:58,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:58,711 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 137 [2018-04-10 16:02:58,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 18 [2018-04-10 16:02:58,716 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 19 [2018-04-10 16:02:58,716 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:58,721 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:58,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:58,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:58,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:58,756 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 69 treesize of output 71 [2018-04-10 16:02:58,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2018-04-10 16:02:58,758 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:58,767 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:58,788 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:59,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:59,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:59,158 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 95 treesize of output 103 [2018-04-10 16:02:59,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16:02:59,162 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 19 [2018-04-10 16:02:59,162 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:59,164 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:59,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:59,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:59,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:59,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 58 [2018-04-10 16:02:59,190 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 32 treesize of output 27 [2018-04-10 16:02:59,190 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:59,197 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:59,208 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:59,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:59,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:59,496 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 110 treesize of output 126 [2018-04-10 16:02:59,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16:02:59,499 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 27 [2018-04-10 16:02:59,500 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:59,502 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:59,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:59,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:02:59,530 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:59,531 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 56 treesize of output 82 [2018-04-10 16:02:59,532 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:02:59,533 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 32 treesize of output 30 [2018-04-10 16:02:59,533 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-04-10 16:02:59,544 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:59,558 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:02:59,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 6 dim-1 vars, 6 dim-2 vars, End of recursive call: 18 dim-0 vars, and 10 xjuncts. [2018-04-10 16:02:59,774 INFO L202 ElimStorePlain]: Needed 76 recursive calls to eliminate 25 variables, input treesize:502, output treesize:863 [2018-04-10 16:03:00,110 WARN L151 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 296 DAG size of output 89 [2018-04-10 16:03:00,711 WARN L148 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 99 [2018-04-10 16:03:01,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,127 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 152 treesize of output 165 [2018-04-10 16:03:01,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:01,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,195 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 122 treesize of output 135 [2018-04-10 16:03:01,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:01,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,266 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 122 treesize of output 135 [2018-04-10 16:03:01,266 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:01,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-10 16:03:01,328 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:397, output treesize:394 [2018-04-10 16:03:01,507 WARN L148 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 103 [2018-04-10 16:03:01,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,514 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 167 treesize of output 161 [2018-04-10 16:03:01,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:01,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 131 [2018-04-10 16:03:01,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:01,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,520 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 137 treesize of output 131 [2018-04-10 16:03:01,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:01,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,704 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:03:01,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,716 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 137 [2018-04-10 16:03:01,767 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 89 [2018-04-10 16:03:01,767 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 16:03:01,835 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:03:01,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,984 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:03:01,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:01,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 133 [2018-04-10 16:03:01,997 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 68 treesize of output 58 [2018-04-10 16:03:01,997 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:02,015 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:03:02,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:02,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:02,111 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:03:02,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 116 [2018-04-10 16:03:02,119 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 58 treesize of output 74 [2018-04-10 16:03:02,119 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:02,140 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:03:02,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:02,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:02,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:02,222 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 0 case distinctions, treesize of input 153 treesize of output 158 [2018-04-10 16:03:02,224 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 156 treesize of output 127 [2018-04-10 16:03:02,225 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:03:02,241 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:03:02,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:02,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:02,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:02,303 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:03:02,304 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 115 treesize of output 137 [2018-04-10 16:03:02,306 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 66 treesize of output 84 [2018-04-10 16:03:02,306 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:02,322 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:03:02,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:02,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:02,374 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:03:02,377 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 104 treesize of output 116 [2018-04-10 16:03:02,379 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 58 treesize of output 74 [2018-04-10 16:03:02,379 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:02,393 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:03:02,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-10 16:03:02,431 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 11 variables, input treesize:442, output treesize:295 [2018-04-10 16:03:02,819 WARN L148 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 108 [2018-04-10 16:03:03,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:03,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:03,010 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:03:03,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:03,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:03,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2018-04-10 16:03:03,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:03,022 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 16:03:03,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:131, output treesize:89 [2018-04-10 16:03:03,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:03,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:03,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 103 [2018-04-10 16:03:03,144 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 21 treesize of output 13 [2018-04-10 16:03:03,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:03,152 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:03:03,153 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 19 treesize of output 23 [2018-04-10 16:03:03,153 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:03,159 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 65 treesize of output 35 [2018-04-10 16:03:03,159 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 16:03:03,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:03:03,175 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2018-04-10 16:03:03,176 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 30 treesize of output 15 [2018-04-10 16:03:03,176 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:03,182 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:03:03,182 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 16:03:03,182 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:03,193 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:03:03,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 9 [2018-04-10 16:03:03,194 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:03,196 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:03:03,201 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 16:03:03,201 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:151, output treesize:9 [2018-04-10 16:03:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 16:03:03,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:03:03,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-10 16:03:03,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 16:03:03,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 16:03:03,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1293, Unknown=4, NotChecked=0, Total=1406 [2018-04-10 16:03:03,377 INFO L87 Difference]: Start difference. First operand 400 states and 457 transitions. Second operand 38 states. [2018-04-10 16:03:05,524 WARN L151 SmtUtils]: Spent 484ms on a formula simplification. DAG size of input: 143 DAG size of output 139 [2018-04-10 16:03:06,303 WARN L151 SmtUtils]: Spent 414ms on a formula simplification. DAG size of input: 147 DAG size of output 138 [2018-04-10 16:03:06,963 WARN L151 SmtUtils]: Spent 510ms on a formula simplification. DAG size of input: 158 DAG size of output 146 [2018-04-10 16:03:07,442 WARN L151 SmtUtils]: Spent 373ms on a formula simplification. DAG size of input: 150 DAG size of output 141 [2018-04-10 16:03:08,116 WARN L151 SmtUtils]: Spent 593ms on a formula simplification. DAG size of input: 152 DAG size of output 150 [2018-04-10 16:03:09,031 WARN L151 SmtUtils]: Spent 585ms on a formula simplification. DAG size of input: 152 DAG size of output 150 [2018-04-10 16:03:09,423 WARN L151 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 110 DAG size of output 106 [2018-04-10 16:03:09,657 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 108 DAG size of output 108 [2018-04-10 16:03:09,982 WARN L151 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 113 DAG size of output 113 [2018-04-10 16:03:11,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:03:11,413 INFO L93 Difference]: Finished difference Result 443 states and 502 transitions. [2018-04-10 16:03:11,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 16:03:11,413 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2018-04-10 16:03:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:03:11,414 INFO L225 Difference]: With dead ends: 443 [2018-04-10 16:03:11,414 INFO L226 Difference]: Without dead ends: 443 [2018-04-10 16:03:11,415 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=300, Invalid=3728, Unknown=4, NotChecked=0, Total=4032 [2018-04-10 16:03:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-04-10 16:03:11,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 405. [2018-04-10 16:03:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-04-10 16:03:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 462 transitions. [2018-04-10 16:03:11,419 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 462 transitions. Word has length 80 [2018-04-10 16:03:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:03:11,420 INFO L459 AbstractCegarLoop]: Abstraction has 405 states and 462 transitions. [2018-04-10 16:03:11,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 16:03:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 462 transitions. [2018-04-10 16:03:11,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-10 16:03:11,420 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:03:11,420 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 16:03:11,420 INFO L408 AbstractCegarLoop]: === Iteration 69 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-10 16:03:11,420 INFO L82 PathProgramCache]: Analyzing trace with hash -341999579, now seen corresponding path program 1 times [2018-04-10 16:03:11,420 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:03:11,420 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:03:11,421 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:03:11,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:03:11,421 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:03:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:03:11,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:03:11,429 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:03:11,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:03:11,429 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:03:11,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:03:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:03:11,467 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:03:11,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:03:11,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:11,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:03:11,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:11,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:03:11,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:03:11,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:11,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:11,508 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 17 treesize of output 24 [2018-04-10 16:03:11,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:11,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:11,514 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 16:03:11,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:11,519 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 16:03:11,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-04-10 16:03:11,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 16:03:11,677 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 16:03:11,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:11,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:03:11,695 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 16:03:11,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:85 [2018-04-10 16:03:11,742 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 58 treesize of output 64 [2018-04-10 16:03:11,744 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 59 treesize of output 58 [2018-04-10 16:03:11,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:11,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:11,774 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 2 case distinctions, treesize of input 50 treesize of output 56 [2018-04-10 16:03:11,775 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 16:03:11,800 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 16:03:11,832 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 16:03:11,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 8 treesize of output 7 [2018-04-10 16:03:11,834 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:11,836 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:03:11,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:03:11,867 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:104, output treesize:212 [2018-04-10 16:03:11,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:11,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:11,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:11,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:11,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:11,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:11,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:11,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2018-04-10 16:03:11,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:12,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,009 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 111 [2018-04-10 16:03:12,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:12,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-04-10 16:03:12,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:12,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 38 [2018-04-10 16:03:12,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:03:12,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:03:12,081 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:198, output treesize:76 [2018-04-10 16:03:12,106 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 74 treesize of output 62 [2018-04-10 16:03:12,108 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:03:12,108 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 62 treesize of output 53 [2018-04-10 16:03:12,108 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 16:03:12,115 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 16:03:12,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 16:03:12,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:66 [2018-04-10 16:03:12,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,151 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:03:12,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:03:12,152 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 52 treesize of output 48 [2018-04-10 16:03:12,155 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:03:12,159 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 30 treesize of output 32 [2018-04-10 16:03:12,159 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 16:03:12,169 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:03:12,169 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 21 treesize of output 20 [2018-04-10 16:03:12,170 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:03:12,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:03:12,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:03:12,179 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:73, output treesize:4 [2018-04-10 16:03:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 16:03:12,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:03:12,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-10 16:03:12,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 16:03:12,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 16:03:12,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=408, Unknown=1, NotChecked=0, Total=462 [2018-04-10 16:03:12,242 INFO L87 Difference]: Start difference. First operand 405 states and 462 transitions. Second operand 22 states. Received shutdown request... [2018-04-10 16:03:12,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:03:12,541 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 16:03:12,544 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 16:03:12,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:03:12 BoogieIcfgContainer [2018-04-10 16:03:12,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:03:12,545 INFO L168 Benchmark]: Toolchain (without parser) took 186116.61 ms. Allocated memory was 403.2 MB in the beginning and 560.5 MB in the end (delta: 157.3 MB). Free memory was 335.5 MB in the beginning and 469.4 MB in the end (delta: -134.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-04-10 16:03:12,546 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 403.2 MB. Free memory is still 360.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:03:12,546 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.49 ms. Allocated memory is still 403.2 MB. Free memory was 335.5 MB in the beginning and 308.9 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 5.3 GB. [2018-04-10 16:03:12,546 INFO L168 Benchmark]: Boogie Preprocessor took 46.08 ms. Allocated memory is still 403.2 MB. Free memory was 308.9 MB in the beginning and 306.2 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:03:12,546 INFO L168 Benchmark]: RCFGBuilder took 449.03 ms. Allocated memory was 403.2 MB in the beginning and 588.3 MB in the end (delta: 185.1 MB). Free memory was 306.2 MB in the beginning and 510.3 MB in the end (delta: -204.1 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-10 16:03:12,547 INFO L168 Benchmark]: TraceAbstraction took 185372.38 ms. Allocated memory was 588.3 MB in the beginning and 560.5 MB in the end (delta: -27.8 MB). Free memory was 508.9 MB in the beginning and 469.4 MB in the end (delta: 39.5 MB). Peak memory consumption was 11.7 MB. Max. memory is 5.3 GB. [2018-04-10 16:03:12,548 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.15 ms. Allocated memory is still 403.2 MB. Free memory is still 360.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 246.49 ms. Allocated memory is still 403.2 MB. Free memory was 335.5 MB in the beginning and 308.9 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.08 ms. Allocated memory is still 403.2 MB. Free memory was 308.9 MB in the beginning and 306.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 449.03 ms. Allocated memory was 403.2 MB in the beginning and 588.3 MB in the end (delta: 185.1 MB). Free memory was 306.2 MB in the beginning and 510.3 MB in the end (delta: -204.1 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 185372.38 ms. Allocated memory was 588.3 MB in the beginning and 560.5 MB in the end (delta: -27.8 MB). Free memory was 508.9 MB in the beginning and 469.4 MB in the end (delta: 39.5 MB). Peak memory consumption was 11.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 562]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 562]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 580]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 576]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 580]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 576]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 568]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 568]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 567]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 567]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (405states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 133 locations, 45 error locations. TIMEOUT Result, 185.3s OverallTime, 69 OverallIterations, 7 TraceHistogramMax, 87.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6459 SDtfs, 5721 SDslu, 34506 SDs, 0 SdLazy, 45715 SolverSat, 1100 SolverUnsat, 140 SolverUnknown, 0 SolverNotchecked, 60.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3122 GetRequests, 1744 SyntacticMatches, 37 SemanticMatches, 1341 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 8573 ImplicationChecksByTransitivity, 54.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=452occurred in iteration=60, 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, 68 MinimizatonAttempts, 1584 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 95.5s InterpolantComputationTime, 5670 NumberOfCodeBlocks, 5573 NumberOfCodeBlocksAsserted, 114 NumberOfCheckSat, 3410 ConstructedInterpolants, 1044 QuantifiedInterpolants, 6488773 SizeOfPredicates, 644 NumberOfNonLiveVariables, 10572 ConjunctsInSsa, 2143 ConjunctsInUnsatCore, 74 InterpolantComputations, 48 PerfectInterpolantSequences, 303/905 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/optional_data_creation_test04_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_16-03-12-553.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_16-03-12-553.csv Completed graceful shutdown