java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 16:08:22,024 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 16:08:22,026 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 16:08:22,039 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 16:08:22,039 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 16:08:22,040 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 16:08:22,041 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 16:08:22,042 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 16:08:22,044 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 16:08:22,045 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 16:08:22,045 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 16:08:22,046 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 16:08:22,046 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 16:08:22,047 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 16:08:22,048 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 16:08:22,050 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 16:08:22,051 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 16:08:22,052 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 16:08:22,053 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 16:08:22,054 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 16:08:22,056 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 16:08:22,056 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 16:08:22,056 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 16:08:22,057 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 16:08:22,058 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 16:08:22,059 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 16:08:22,059 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 16:08:22,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 16:08:22,060 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 16:08:22,060 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 16:08:22,061 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 16:08:22,061 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-11 16:08:22,080 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 16:08:22,081 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 16:08:22,082 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 16:08:22,082 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 16:08:22,082 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 16:08:22,082 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 16:08:22,082 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 16:08:22,082 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 16:08:22,083 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 16:08:22,083 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 16:08:22,083 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 16:08:22,083 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 16:08:22,083 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 16:08:22,083 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 16:08:22,083 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 16:08:22,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 16:08:22,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 16:08:22,084 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 16:08:22,084 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 16:08:22,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 16:08:22,084 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 16:08:22,084 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 16:08:22,085 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 16:08:22,085 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 16:08:22,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 16:08:22,122 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 16:08:22,125 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 16:08:22,126 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 16:08:22,126 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 16:08:22,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,422 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG0afe95561 [2018-04-11 16:08:22,583 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 16:08:22,583 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 16:08:22,584 INFO L168 CDTParser]: Scanning length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,593 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 16:08:22,593 INFO L215 ultiparseSymbolTable]: [2018-04-11 16:08:22,593 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 16:08:22,593 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___true_valid_memsafety_i__append ('append') in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,593 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___true_valid_memsafety_i____bswap_64 ('__bswap_64') in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,593 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,593 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___true_valid_memsafety_i____bswap_32 ('__bswap_32') in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,594 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 16:08:22,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__nlink_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fd_mask in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__wchar_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_attr_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____sig_atomic_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_once_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int8_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__dev_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_condattr_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,595 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__id_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,595 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_int in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,595 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,595 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____clock_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,595 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__timer_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,595 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__clockid_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,595 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fsid_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,595 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____int8_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,595 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_spinlock_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,595 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____nlink_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,595 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____sigset_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,595 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__suseconds_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,596 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____blkcnt64_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,596 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uint64_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,596 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__gid_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,596 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ssize_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,596 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fd_mask in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,596 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_short in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,596 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__uint in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,596 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_long in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,596 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uid_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,596 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pid_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,596 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsword_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,596 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____ino64_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,596 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uint16_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,596 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__int8_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,597 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__daddr_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,597 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__clock_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,597 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____syscall_slong_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,597 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____loff_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,597 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____blkcnt_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,597 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__register_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,597 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__int64_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,597 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____daddr_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,597 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsfilcnt_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_barrierattr_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ldiv_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_quad_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ushort in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_mutex_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____time_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int64_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____useconds_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsfilcnt64_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__loff_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____key_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ino_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uint8_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____int64_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____qaddr_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__int16_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__blksize_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_char in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____blksize_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_key_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_rwlock_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__lldiv_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____dev_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsblkcnt_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__uid_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____rlim64_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uint32_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fsblkcnt_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__time_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__div_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____int32_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____id_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____syscall_ulong_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ulong in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__mode_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__sigset_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____pthread_slist_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int32_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_short in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__caddr_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__key_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_rwlockattr_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____caddr_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fd_set in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____off_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____quad_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____mode_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fsfilcnt_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsid_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____gid_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__int32_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____pid_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____ssize_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____socklen_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_mutexattr_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____ino_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__off_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____timer_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_long in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_cond_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____int16_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__size_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____intptr_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int16_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__blkcnt_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____rlim_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____clockid_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_char in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__quad_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsblkcnt64_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____off64_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____suseconds_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_barrier_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_quad_t in length_test03_true-valid-memsafety.i [2018-04-11 16:08:22,618 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG0afe95561 [2018-04-11 16:08:22,620 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 16:08:22,621 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 16:08:22,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 16:08:22,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 16:08:22,625 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 16:08:22,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 04:08:22" (1/1) ... [2018-04-11 16:08:22,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b336af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:22, skipping insertion in model container [2018-04-11 16:08:22,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 04:08:22" (1/1) ... [2018-04-11 16:08:22,637 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 16:08:22,661 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 16:08:22,784 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 16:08:22,825 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 16:08:22,831 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 119 non ball SCCs. Number of states in SCCs 119. [2018-04-11 16:08:22,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:22 WrapperNode [2018-04-11 16:08:22,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 16:08:22,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 16:08:22,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 16:08:22,872 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 16:08:22,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:22" (1/1) ... [2018-04-11 16:08:22,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:22" (1/1) ... [2018-04-11 16:08:22,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:22" (1/1) ... [2018-04-11 16:08:22,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:22" (1/1) ... [2018-04-11 16:08:22,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:22" (1/1) ... [2018-04-11 16:08:22,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:22" (1/1) ... [2018-04-11 16:08:22,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:22" (1/1) ... [2018-04-11 16:08:22,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 16:08:22,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 16:08:22,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 16:08:22,916 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 16:08:22,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:22" (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-11 16:08:23,018 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 16:08:23,019 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 16:08:23,019 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___true_valid_memsafety_i____bswap_32 [2018-04-11 16:08:23,019 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___true_valid_memsafety_i____bswap_64 [2018-04-11 16:08:23,019 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___true_valid_memsafety_i__append [2018-04-11 16:08:23,019 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 16:08:23,019 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 16:08:23,019 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 16:08:23,019 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 16:08:23,019 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 16:08:23,019 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 16:08:23,020 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 16:08:23,020 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 16:08:23,020 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 16:08:23,020 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 16:08:23,020 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 16:08:23,020 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 16:08:23,020 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 16:08:23,020 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 16:08:23,020 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 16:08:23,020 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 16:08:23,021 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 16:08:23,021 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 16:08:23,021 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___true_valid_memsafety_i____bswap_32 [2018-04-11 16:08:23,021 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___true_valid_memsafety_i____bswap_64 [2018-04-11 16:08:23,021 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 16:08:23,021 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 16:08:23,021 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 16:08:23,021 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 16:08:23,021 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 16:08:23,021 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 16:08:23,021 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 16:08:23,022 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 16:08:23,022 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 16:08:23,022 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 16:08:23,022 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 16:08:23,022 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 16:08:23,022 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 16:08:23,022 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 16:08:23,022 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 16:08:23,022 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 16:08:23,023 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 16:08:23,023 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 16:08:23,023 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 16:08:23,023 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 16:08:23,023 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 16:08:23,023 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 16:08:23,023 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 16:08:23,023 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 16:08:23,023 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 16:08:23,024 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 16:08:23,024 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 16:08:23,024 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 16:08:23,024 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 16:08:23,024 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 16:08:23,024 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 16:08:23,024 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 16:08:23,024 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 16:08:23,024 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 16:08:23,024 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 16:08:23,025 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 16:08:23,025 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 16:08:23,025 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 16:08:23,025 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 16:08:23,025 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 16:08:23,025 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 16:08:23,025 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 16:08:23,025 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 16:08:23,025 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 16:08:23,025 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 16:08:23,026 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 16:08:23,026 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 16:08:23,026 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 16:08:23,026 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 16:08:23,026 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 16:08:23,026 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 16:08:23,026 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 16:08:23,026 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 16:08:23,026 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 16:08:23,026 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 16:08:23,026 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 16:08:23,026 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 16:08:23,026 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 16:08:23,026 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 16:08:23,026 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 16:08:23,026 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 16:08:23,027 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 16:08:23,027 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 16:08:23,027 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 16:08:23,027 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 16:08:23,027 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 16:08:23,027 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 16:08:23,027 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 16:08:23,027 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 16:08:23,027 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 16:08:23,027 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 16:08:23,027 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 16:08:23,027 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 16:08:23,027 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 16:08:23,027 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 16:08:23,028 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 16:08:23,028 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 16:08:23,028 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 16:08:23,028 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 16:08:23,028 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 16:08:23,028 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 16:08:23,028 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 16:08:23,028 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 16:08:23,028 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 16:08:23,028 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 16:08:23,028 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 16:08:23,029 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 16:08:23,029 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-04-11 16:08:23,029 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 16:08:23,029 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___true_valid_memsafety_i__append [2018-04-11 16:08:23,029 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 16:08:23,029 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 16:08:23,029 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 16:08:23,029 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 16:08:23,029 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 16:08:23,030 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 16:08:23,030 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 16:08:23,030 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 16:08:23,030 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 16:08:23,030 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 16:08:23,391 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 16:08:23,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 04:08:23 BoogieIcfgContainer [2018-04-11 16:08:23,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 16:08:23,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 16:08:23,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 16:08:23,394 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 16:08:23,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 04:08:22" (1/3) ... [2018-04-11 16:08:23,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26971b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 04:08:23, skipping insertion in model container [2018-04-11 16:08:23,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:22" (2/3) ... [2018-04-11 16:08:23,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26971b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 04:08:23, skipping insertion in model container [2018-04-11 16:08:23,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 04:08:23" (3/3) ... [2018-04-11 16:08:23,397 INFO L107 eAbstractionObserver]: Analyzing ICFG length_test03_true-valid-memsafety.i [2018-04-11 16:08:23,403 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 16:08:23,408 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-11 16:08:23,433 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 16:08:23,434 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 16:08:23,434 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 16:08:23,434 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 16:08:23,434 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 16:08:23,434 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 16:08:23,434 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 16:08:23,434 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 16:08:23,434 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 16:08:23,435 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 16:08:23,447 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2018-04-11 16:08:23,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 16:08:23,454 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:23,454 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:23,454 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:23,457 INFO L82 PathProgramCache]: Analyzing trace with hash 785922242, now seen corresponding path program 1 times [2018-04-11 16:08:23,458 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:23,459 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:23,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:23,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:23,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:23,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:23,554 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-11 16:08:23,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:23,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 16:08:23,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 16:08:23,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 16:08:23,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 16:08:23,566 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 4 states. [2018-04-11 16:08:23,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:23,768 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-04-11 16:08:23,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 16:08:23,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 16:08:23,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:23,780 INFO L225 Difference]: With dead ends: 175 [2018-04-11 16:08:23,780 INFO L226 Difference]: Without dead ends: 172 [2018-04-11 16:08:23,782 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-11 16:08:23,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-11 16:08:23,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 134. [2018-04-11 16:08:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 16:08:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-04-11 16:08:23,816 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 8 [2018-04-11 16:08:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:23,817 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-04-11 16:08:23,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 16:08:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-04-11 16:08:23,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 16:08:23,817 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:23,817 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:23,817 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:23,818 INFO L82 PathProgramCache]: Analyzing trace with hash 785922243, now seen corresponding path program 1 times [2018-04-11 16:08:23,818 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:23,818 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:23,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:23,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:23,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:23,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:23,864 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-11 16:08:23,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:23,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 16:08:23,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 16:08:23,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 16:08:23,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 16:08:23,865 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 4 states. [2018-04-11 16:08:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:23,982 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-11 16:08:23,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 16:08:23,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 16:08:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:23,983 INFO L225 Difference]: With dead ends: 134 [2018-04-11 16:08:23,983 INFO L226 Difference]: Without dead ends: 134 [2018-04-11 16:08:23,984 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-11 16:08:23,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-11 16:08:23,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-04-11 16:08:23,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-11 16:08:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-04-11 16:08:23,988 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 8 [2018-04-11 16:08:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:23,988 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-04-11 16:08:23,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 16:08:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-04-11 16:08:23,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 16:08:23,989 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:23,989 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:23,989 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:23,989 INFO L82 PathProgramCache]: Analyzing trace with hash 580924999, now seen corresponding path program 1 times [2018-04-11 16:08:23,989 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:23,989 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:23,990 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:23,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:23,990 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:23,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:24,029 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-11 16:08:24,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:24,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 16:08:24,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 16:08:24,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 16:08:24,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 16:08:24,031 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 4 states. [2018-04-11 16:08:24,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:24,130 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2018-04-11 16:08:24,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 16:08:24,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-11 16:08:24,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:24,131 INFO L225 Difference]: With dead ends: 132 [2018-04-11 16:08:24,131 INFO L226 Difference]: Without dead ends: 132 [2018-04-11 16:08:24,132 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:08:24,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-11 16:08:24,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-04-11 16:08:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-11 16:08:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-04-11 16:08:24,138 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 12 [2018-04-11 16:08:24,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:24,139 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-04-11 16:08:24,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 16:08:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-04-11 16:08:24,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 16:08:24,139 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:24,139 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:24,139 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:24,139 INFO L82 PathProgramCache]: Analyzing trace with hash 580924998, now seen corresponding path program 1 times [2018-04-11 16:08:24,140 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:24,140 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:24,140 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:24,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:24,140 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:24,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:24,168 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-11 16:08:24,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:24,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 16:08:24,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 16:08:24,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 16:08:24,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 16:08:24,169 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 4 states. [2018-04-11 16:08:24,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:24,253 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2018-04-11 16:08:24,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 16:08:24,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-11 16:08:24,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:24,254 INFO L225 Difference]: With dead ends: 146 [2018-04-11 16:08:24,254 INFO L226 Difference]: Without dead ends: 146 [2018-04-11 16:08:24,254 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-11 16:08:24,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-11 16:08:24,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2018-04-11 16:08:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-11 16:08:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-04-11 16:08:24,259 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 12 [2018-04-11 16:08:24,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:24,259 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-04-11 16:08:24,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 16:08:24,260 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-04-11 16:08:24,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 16:08:24,260 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:24,260 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:24,260 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:24,260 INFO L82 PathProgramCache]: Analyzing trace with hash 606155154, now seen corresponding path program 1 times [2018-04-11 16:08:24,260 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:24,261 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:24,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:24,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:24,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:24,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:24,301 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-11 16:08:24,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:24,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 16:08:24,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 16:08:24,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 16:08:24,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 16:08:24,302 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 4 states. [2018-04-11 16:08:24,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:24,371 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-04-11 16:08:24,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 16:08:24,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-11 16:08:24,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:24,372 INFO L225 Difference]: With dead ends: 128 [2018-04-11 16:08:24,372 INFO L226 Difference]: Without dead ends: 128 [2018-04-11 16:08:24,372 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-11 16:08:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-11 16:08:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-04-11 16:08:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 16:08:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-04-11 16:08:24,375 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 20 [2018-04-11 16:08:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:24,375 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-04-11 16:08:24,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 16:08:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-04-11 16:08:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 16:08:24,376 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:24,376 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:24,376 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:24,376 INFO L82 PathProgramCache]: Analyzing trace with hash 606155155, now seen corresponding path program 1 times [2018-04-11 16:08:24,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:24,376 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:24,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:24,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:24,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:24,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:24,427 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-11 16:08:24,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:24,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 16:08:24,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 16:08:24,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 16:08:24,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 16:08:24,428 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 4 states. [2018-04-11 16:08:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:24,479 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-04-11 16:08:24,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 16:08:24,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-11 16:08:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:24,479 INFO L225 Difference]: With dead ends: 123 [2018-04-11 16:08:24,480 INFO L226 Difference]: Without dead ends: 123 [2018-04-11 16:08:24,480 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-11 16:08:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-11 16:08:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-04-11 16:08:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 16:08:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-04-11 16:08:24,484 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 20 [2018-04-11 16:08:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:24,484 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-04-11 16:08:24,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 16:08:24,484 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-04-11 16:08:24,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 16:08:24,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:24,485 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:24,485 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:24,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1610940695, now seen corresponding path program 1 times [2018-04-11 16:08:24,485 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:24,485 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:24,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:24,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:24,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:24,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:24,503 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:24,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:24,503 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:24,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:24,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:24,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 6 treesize of output 5 [2018-04-11 16:08:24,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:24,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:24,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 16:08:24,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:24,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:24,593 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-11 16:08:24,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:24,598 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-11 16:08:24,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 16:08:24,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, 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-11 16:08:24,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:24,648 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-11 16:08:24,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-04-11 16:08:24,658 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-11 16:08:24,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:24,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 16:08:24,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 16:08:24,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 16:08:24,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 16:08:24,659 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 7 states. [2018-04-11 16:08:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:24,929 INFO L93 Difference]: Finished difference Result 238 states and 254 transitions. [2018-04-11 16:08:24,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 16:08:24,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-04-11 16:08:24,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:24,931 INFO L225 Difference]: With dead ends: 238 [2018-04-11 16:08:24,931 INFO L226 Difference]: Without dead ends: 238 [2018-04-11 16:08:24,931 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-11 16:08:24,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-11 16:08:24,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 150. [2018-04-11 16:08:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-11 16:08:24,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2018-04-11 16:08:24,936 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 21 [2018-04-11 16:08:24,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:24,937 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2018-04-11 16:08:24,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 16:08:24,937 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2018-04-11 16:08:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 16:08:24,937 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:24,937 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:24,938 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:24,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1610940696, now seen corresponding path program 1 times [2018-04-11 16:08:24,938 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:24,938 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:24,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:24,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:24,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:24,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:24,956 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:24,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:24,956 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:24,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:24,992 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:24,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:24,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:25,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:08:25,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:25,027 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-11 16:08:25,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:25,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:25,036 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-11 16:08:25,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,041 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-11 16:08:25,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-11 16:08:25,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:25,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 17 treesize of output 28 [2018-04-11 16:08:25,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:25,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 16:08:25,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:69 [2018-04-11 16:08:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:08:25,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:25,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 16:08:25,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 16:08:25,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 16:08:25,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-11 16:08:25,172 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand 9 states. [2018-04-11 16:08:25,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:25,459 INFO L93 Difference]: Finished difference Result 178 states and 200 transitions. [2018-04-11 16:08:25,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 16:08:25,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-11 16:08:25,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:25,460 INFO L225 Difference]: With dead ends: 178 [2018-04-11 16:08:25,460 INFO L226 Difference]: Without dead ends: 178 [2018-04-11 16:08:25,460 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-04-11 16:08:25,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-11 16:08:25,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-04-11 16:08:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 16:08:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2018-04-11 16:08:25,463 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 21 [2018-04-11 16:08:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:25,464 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2018-04-11 16:08:25,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 16:08:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2018-04-11 16:08:25,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 16:08:25,464 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:25,464 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-11 16:08:25,464 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:25,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1221998067, now seen corresponding path program 1 times [2018-04-11 16:08:25,464 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:25,465 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:25,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:25,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:25,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:25,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:25,484 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:25,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:25,484 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:25,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:25,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:25,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:08:25,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:08:25,564 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-11 16:08:25,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:08:25,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,580 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-11 16:08:25,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:25,582 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,583 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,589 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-11 16:08:25,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 16:08:25,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:25,605 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-11 16:08:25,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 16:08:25,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:25,623 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-11 16:08:25,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-11 16:08:25,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:25,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:25,655 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-11 16:08:25,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:56 [2018-04-11 16:08:25,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 16:08:25,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:25,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 16:08:25,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:25,728 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,744 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:70 [2018-04-11 16:08:25,770 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 34 [2018-04-11 16:08:25,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, 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-11 16:08:25,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,798 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 34 [2018-04-11 16:08:25,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, 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-11 16:08:25,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:08:25,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:81 [2018-04-11 16:08:25,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:25,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:25,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:25,949 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-11 16:08:25,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:25,968 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-11 16:08:25,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:82 [2018-04-11 16:08:26,047 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 38 treesize of output 32 [2018-04-11 16:08:26,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:26,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:26,053 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:26,054 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 18 treesize of output 19 [2018-04-11 16:08:26,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:26,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:26,084 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-11 16:08:26,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:99, output treesize:62 [2018-04-11 16:08:26,189 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-11 16:08:26,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:26,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-11 16:08:26,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 16:08:26,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 16:08:26,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=194, Unknown=1, NotChecked=0, Total=240 [2018-04-11 16:08:26,190 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 16 states. [2018-04-11 16:08:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:27,304 INFO L93 Difference]: Finished difference Result 178 states and 199 transitions. [2018-04-11 16:08:27,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 16:08:27,305 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-04-11 16:08:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:27,306 INFO L225 Difference]: With dead ends: 178 [2018-04-11 16:08:27,306 INFO L226 Difference]: Without dead ends: 178 [2018-04-11 16:08:27,306 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=598, Unknown=3, NotChecked=0, Total=756 [2018-04-11 16:08:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-11 16:08:27,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-04-11 16:08:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 16:08:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 199 transitions. [2018-04-11 16:08:27,310 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 199 transitions. Word has length 30 [2018-04-11 16:08:27,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:27,310 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 199 transitions. [2018-04-11 16:08:27,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 16:08:27,310 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 199 transitions. [2018-04-11 16:08:27,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 16:08:27,315 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:27,315 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:27,315 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:27,315 INFO L82 PathProgramCache]: Analyzing trace with hash 547197936, now seen corresponding path program 1 times [2018-04-11 16:08:27,315 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:27,315 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:27,316 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:27,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:27,316 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:27,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:27,343 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:27,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:27,343 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:27,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:27,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:27,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:27,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 16:08:27,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 16:08:27,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:08:27,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,437 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-11 16:08:27,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:27,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,448 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-04-11 16:08:27,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:27,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:27,462 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-11 16:08:27,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2018-04-11 16:08:27,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-11 16:08:27,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 8 treesize of output 7 [2018-04-11 16:08:27,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-11 16:08:27,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:27,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,543 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2018-04-11 16:08:27,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-04-11 16:08:27,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:27,566 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-11 16:08:27,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-04-11 16:08:27,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:27,586 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-11 16:08:27,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,601 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-11 16:08:27,602 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:65 [2018-04-11 16:08:27,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:27,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:27,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:27,681 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 16 treesize of output 20 [2018-04-11 16:08:27,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:27,692 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-11 16:08:27,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:63 [2018-04-11 16:08:27,874 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-11 16:08:27,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:27,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-11 16:08:27,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 16:08:27,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 16:08:27,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-04-11 16:08:27,876 INFO L87 Difference]: Start difference. First operand 176 states and 199 transitions. Second operand 15 states. [2018-04-11 16:08:28,180 WARN L148 SmtUtils]: Spent 131ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-11 16:08:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:28,802 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2018-04-11 16:08:28,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 16:08:28,802 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-04-11 16:08:28,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:28,803 INFO L225 Difference]: With dead ends: 203 [2018-04-11 16:08:28,803 INFO L226 Difference]: Without dead ends: 203 [2018-04-11 16:08:28,803 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-04-11 16:08:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-11 16:08:28,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 168. [2018-04-11 16:08:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 16:08:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2018-04-11 16:08:28,806 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 32 [2018-04-11 16:08:28,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:28,806 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2018-04-11 16:08:28,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 16:08:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2018-04-11 16:08:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 16:08:28,807 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:28,807 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:28,807 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:28,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1510794234, now seen corresponding path program 1 times [2018-04-11 16:08:28,807 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:28,807 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:28,808 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:28,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:28,808 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:28,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:28,865 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-11 16:08:28,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:28,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 16:08:28,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 16:08:28,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 16:08:28,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 16:08:28,866 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 3 states. [2018-04-11 16:08:28,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:28,877 INFO L93 Difference]: Finished difference Result 177 states and 194 transitions. [2018-04-11 16:08:28,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 16:08:28,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-04-11 16:08:28,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:28,879 INFO L225 Difference]: With dead ends: 177 [2018-04-11 16:08:28,879 INFO L226 Difference]: Without dead ends: 177 [2018-04-11 16:08:28,879 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 16:08:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-11 16:08:28,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2018-04-11 16:08:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-11 16:08:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2018-04-11 16:08:28,883 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 38 [2018-04-11 16:08:28,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:28,883 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2018-04-11 16:08:28,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 16:08:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2018-04-11 16:08:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 16:08:28,884 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:28,885 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:28,885 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:28,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1650874349, now seen corresponding path program 1 times [2018-04-11 16:08:28,885 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:28,885 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:28,886 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:28,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:28,886 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:28,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:28,905 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:28,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:28,906 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:28,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:28,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:29,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:29,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:29,029 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-11 16:08:29,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:29,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 14 treesize of output 17 [2018-04-11 16:08:29,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:29,040 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-11 16:08:29,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-11 16:08:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:08:29,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:08:29,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 16:08:29,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 16:08:29,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 16:08:29,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-11 16:08:29,055 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand 10 states. [2018-04-11 16:08:29,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:29,369 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-04-11 16:08:29,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 16:08:29,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-04-11 16:08:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:29,370 INFO L225 Difference]: With dead ends: 177 [2018-04-11 16:08:29,370 INFO L226 Difference]: Without dead ends: 177 [2018-04-11 16:08:29,370 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-11 16:08:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-11 16:08:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2018-04-11 16:08:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-11 16:08:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-04-11 16:08:29,374 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 41 [2018-04-11 16:08:29,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:29,375 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-04-11 16:08:29,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 16:08:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-04-11 16:08:29,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 16:08:29,375 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:29,376 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:29,376 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:29,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1920567715, now seen corresponding path program 1 times [2018-04-11 16:08:29,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:29,376 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:29,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:29,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:29,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:29,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:29,394 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:29,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:29,394 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:29,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:29,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:29,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:29,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:29,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:29,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 16:08:29,454 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| 1)))) is different from true [2018-04-11 16:08:29,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:29,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:29,461 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-11 16:08:29,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:29,465 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-11 16:08:29,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 16:08:29,492 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-11 16:08:29,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:29,497 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-11 16:08:29,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-04-11 16:08:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-04-11 16:08:29,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:08:29,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 16:08:29,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 16:08:29,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 16:08:29,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2018-04-11 16:08:29,508 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 9 states. [2018-04-11 16:08:29,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:29,811 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2018-04-11 16:08:29,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 16:08:29,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-04-11 16:08:29,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:29,812 INFO L225 Difference]: With dead ends: 275 [2018-04-11 16:08:29,812 INFO L226 Difference]: Without dead ends: 275 [2018-04-11 16:08:29,812 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2018-04-11 16:08:29,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-11 16:08:29,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 213. [2018-04-11 16:08:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-11 16:08:29,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 244 transitions. [2018-04-11 16:08:29,816 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 244 transitions. Word has length 43 [2018-04-11 16:08:29,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:29,817 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 244 transitions. [2018-04-11 16:08:29,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 16:08:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 244 transitions. [2018-04-11 16:08:29,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 16:08:29,817 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:29,817 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:29,817 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:29,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1920567716, now seen corresponding path program 1 times [2018-04-11 16:08:29,818 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:29,818 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:29,818 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:29,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:29,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:29,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:29,834 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:29,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:29,834 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:29,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:29,863 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:29,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:29,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:29,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:29,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:29,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:29,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:08:29,900 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| 9)) (= 0 (select |c_old(#valid)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base|)))) is different from true [2018-04-11 16:08:29,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:29,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:29,913 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-11 16:08:29,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:29,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:29,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:29,925 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-11 16:08:29,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:29,930 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-11 16:08:29,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-11 16:08:29,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:29,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:29,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:08:29,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:30,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 16:08:30,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:44 [2018-04-11 16:08:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-04-11 16:08:30,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:08:30,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 16:08:30,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 16:08:30,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 16:08:30,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2018-04-11 16:08:30,056 INFO L87 Difference]: Start difference. First operand 213 states and 244 transitions. Second operand 11 states. [2018-04-11 16:08:30,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:30,601 INFO L93 Difference]: Finished difference Result 268 states and 313 transitions. [2018-04-11 16:08:30,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 16:08:30,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-04-11 16:08:30,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:30,603 INFO L225 Difference]: With dead ends: 268 [2018-04-11 16:08:30,603 INFO L226 Difference]: Without dead ends: 268 [2018-04-11 16:08:30,604 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2018-04-11 16:08:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-11 16:08:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 243. [2018-04-11 16:08:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-11 16:08:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 279 transitions. [2018-04-11 16:08:30,610 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 279 transitions. Word has length 43 [2018-04-11 16:08:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:30,610 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 279 transitions. [2018-04-11 16:08:30,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 16:08:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 279 transitions. [2018-04-11 16:08:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 16:08:30,611 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:30,611 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:30,611 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:30,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1552822926, now seen corresponding path program 1 times [2018-04-11 16:08:30,611 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:30,612 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:30,612 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:30,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:30,612 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:30,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:30,636 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:30,636 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:30,636 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:30,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:30,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:30,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:30,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:30,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:30,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:08:30,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:30,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:30,717 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-11 16:08:30,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:30,724 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-11 16:08:30,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-04-11 16:08:30,836 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-11 16:08:30,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:30,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:30,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:30,854 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-11 16:08:30,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-04-11 16:08:30,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-11 16:08:30,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:30,902 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 21 treesize of output 30 [2018-04-11 16:08:30,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:30,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:30,921 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:30,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:30,943 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-11 16:08:30,943 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-04-11 16:08:31,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 61 [2018-04-11 16:08:31,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:31,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-04-11 16:08:31,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:31,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:31,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:31,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 62 [2018-04-11 16:08:31,052 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:31,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:08:31,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 16:08:31,121 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:81, output treesize:123 [2018-04-11 16:08:31,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:31,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:31,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:31,213 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 88 treesize of output 97 [2018-04-11 16:08:31,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:31,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:08:31,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:152, output treesize:91 [2018-04-11 16:08:31,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:31,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:31,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:31,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:31,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2018-04-11 16:08:31,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:31,462 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-11 16:08:31,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:102, output treesize:114 [2018-04-11 16:08:31,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2018-04-11 16:08:31,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:31,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:31,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:31,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:08:31,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:127, output treesize:114 [2018-04-11 16:08:31,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2018-04-11 16:08:31,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:31,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:31,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:31,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 16:08:31,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:127, output treesize:123 [2018-04-11 16:08:31,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 73 [2018-04-11 16:08:31,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:31,788 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-11 16:08:31,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:31,802 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-11 16:08:31,802 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:31,812 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:31,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2018-04-11 16:08:31,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:31,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:31,846 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-11 16:08:31,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:132, output treesize:45 [2018-04-11 16:08:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:08:31,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:08:31,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 16:08:31,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 16:08:31,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 16:08:31,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-04-11 16:08:31,909 INFO L87 Difference]: Start difference. First operand 243 states and 279 transitions. Second operand 21 states. [2018-04-11 16:08:33,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:33,770 INFO L93 Difference]: Finished difference Result 306 states and 354 transitions. [2018-04-11 16:08:33,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 16:08:33,770 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-04-11 16:08:33,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:33,771 INFO L225 Difference]: With dead ends: 306 [2018-04-11 16:08:33,772 INFO L226 Difference]: Without dead ends: 306 [2018-04-11 16:08:33,772 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=207, Invalid=1199, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 16:08:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-04-11 16:08:33,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 259. [2018-04-11 16:08:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-04-11 16:08:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 303 transitions. [2018-04-11 16:08:33,779 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 303 transitions. Word has length 50 [2018-04-11 16:08:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:33,779 INFO L459 AbstractCegarLoop]: Abstraction has 259 states and 303 transitions. [2018-04-11 16:08:33,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 16:08:33,780 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 303 transitions. [2018-04-11 16:08:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 16:08:33,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:33,781 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:33,781 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:33,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1552822925, now seen corresponding path program 1 times [2018-04-11 16:08:33,781 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:33,781 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:33,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:33,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:33,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:33,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:33,823 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:33,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:33,823 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:33,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:33,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:33,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 6 treesize of output 5 [2018-04-11 16:08:33,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:33,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:33,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:08:33,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:33,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:33,922 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-11 16:08:33,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:33,930 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-11 16:08:33,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-04-11 16:08:34,020 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-11 16:08:34,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:34,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-04-11 16:08:34,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 16:08:34,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:34,064 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-11 16:08:34,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,080 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-11 16:08:34,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:08:34,081 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:08:34,092 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:48 [2018-04-11 16:08:34,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 58 [2018-04-11 16:08:34,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-04-11 16:08:34,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 48 [2018-04-11 16:08:34,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:34,211 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 34 treesize of output 45 [2018-04-11 16:08:34,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,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 35 treesize of output 34 [2018-04-11 16:08:34,228 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:08:34,265 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:74, output treesize:72 [2018-04-11 16:08:34,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 126 [2018-04-11 16:08:34,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:34,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:34,320 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 2 case distinctions, treesize of input 113 treesize of output 139 [2018-04-11 16:08:34,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:34,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:34,389 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 118 treesize of output 145 [2018-04-11 16:08:34,389 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:08:34,505 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:34,505 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 112 treesize of output 102 [2018-04-11 16:08:34,508 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:34,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:34,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 59 [2018-04-11 16:08:34,510 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,525 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,545 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 156 treesize of output 150 [2018-04-11 16:08:34,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:34,550 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 149 treesize of output 176 [2018-04-11 16:08:34,551 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,615 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,655 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-11 16:08:34,655 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:177, output treesize:205 [2018-04-11 16:08:34,726 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 16:08:34,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:34,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:34,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:34,760 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 22 treesize of output 25 [2018-04-11 16:08:34,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,787 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-11 16:08:34,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:239, output treesize:159 [2018-04-11 16:08:34,915 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 26 treesize of output 38 [2018-04-11 16:08:34,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:34,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:34,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:34,953 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-11 16:08:34,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,981 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-11 16:08:34,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:170, output treesize:163 [2018-04-11 16:08:35,091 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-11 16:08:35,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,116 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-11 16:08:35,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:168, output treesize:163 [2018-04-11 16:08:35,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 144 [2018-04-11 16:08:35,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 144 treesize of output 143 [2018-04-11 16:08:35,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:35,313 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 94 treesize of output 145 [2018-04-11 16:08:35,314 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:35,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 16:08:35,445 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 136 [2018-04-11 16:08:35,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:35,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:35,449 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:35,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 90 [2018-04-11 16:08:35,452 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,474 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,482 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 136 [2018-04-11 16:08:35,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:35,486 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:35,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 76 [2018-04-11 16:08:35,488 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,510 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,530 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 173 treesize of output 193 [2018-04-11 16:08:35,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:35,557 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 167 treesize of output 218 [2018-04-11 16:08:35,557 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:35,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 170 treesize of output 169 [2018-04-11 16:08:35,694 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,767 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 16:08:35,838 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 3 xjuncts. [2018-04-11 16:08:35,839 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:195, output treesize:425 [2018-04-11 16:08:35,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, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 204 treesize of output 209 [2018-04-11 16:08:35,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:35,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:35,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 192 treesize of output 225 [2018-04-11 16:08:35,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:36,070 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 199 treesize of output 208 [2018-04-11 16:08:36,070 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,306 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:36,308 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 193 treesize of output 176 [2018-04-11 16:08:36,310 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 36 treesize of output 21 [2018-04-11 16:08:36,310 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,327 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,474 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 200 treesize of output 216 [2018-04-11 16:08:36,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 207 treesize of output 206 [2018-04-11 16:08:36,477 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,550 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,663 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:36,665 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 162 treesize of output 140 [2018-04-11 16:08:36,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:36,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 69 [2018-04-11 16:08:36,669 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,683 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,785 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 193 treesize of output 176 [2018-04-11 16:08:36,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:36,789 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 36 treesize of output 63 [2018-04-11 16:08:36,789 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,816 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,900 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 183 treesize of output 161 [2018-04-11 16:08:36,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:36,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:36,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:36,911 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 55 treesize of output 130 [2018-04-11 16:08:36,911 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,932 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:37,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-11 16:08:37,008 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 11 variables, input treesize:591, output treesize:501 [2018-04-11 16:08:37,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 197 [2018-04-11 16:08:37,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,148 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 190 treesize of output 180 [2018-04-11 16:08:37,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:37,226 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:37,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 152 [2018-04-11 16:08:37,227 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:37,289 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:37,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 178 [2018-04-11 16:08:37,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:37,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,350 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 149 treesize of output 143 [2018-04-11 16:08:37,350 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:37,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 175 treesize of output 183 [2018-04-11 16:08:37,418 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:37,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 16:08:37,622 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 191 treesize of output 162 [2018-04-11 16:08:37,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,629 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 44 treesize of output 61 [2018-04-11 16:08:37,629 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:37,647 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:37,647 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 63 treesize of output 47 [2018-04-11 16:08:37,648 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:37,659 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:37,783 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 1 case distinctions, treesize of input 147 treesize of output 129 [2018-04-11 16:08:37,785 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 125 treesize of output 118 [2018-04-11 16:08:37,785 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:37,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,831 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:37,831 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 118 treesize of output 80 [2018-04-11 16:08:37,831 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:37,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,873 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 74 treesize of output 68 [2018-04-11 16:08:37,873 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:37,910 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:37,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,911 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 121 treesize of output 83 [2018-04-11 16:08:37,911 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:37,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,960 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 77 treesize of output 72 [2018-04-11 16:08:37,960 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,001 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,012 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 1 case distinctions, treesize of input 122 treesize of output 108 [2018-04-11 16:08:38,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,016 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:38,017 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 104 treesize of output 74 [2018-04-11 16:08:38,017 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2018-04-11 16:08:38,079 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,128 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:38,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,129 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 100 treesize of output 70 [2018-04-11 16:08:38,130 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,168 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 61 treesize of output 55 [2018-04-11 16:08:38,168 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,202 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 64 treesize of output 51 [2018-04-11 16:08:38,202 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,220 INFO L267 ElimStorePlain]: Start of recursive call 17: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 101 [2018-04-11 16:08:38,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-11 16:08:38,225 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,244 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-11 16:08:38,244 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,258 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:38,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,259 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 42 treesize of output 27 [2018-04-11 16:08:38,259 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,268 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,338 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 93 treesize of output 75 [2018-04-11 16:08:38,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-11 16:08:38,340 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,350 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:38,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-04-11 16:08:38,351 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,365 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,434 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 149 treesize of output 125 [2018-04-11 16:08:38,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 16:08:38,436 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,452 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:38,452 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 75 treesize of output 56 [2018-04-11 16:08:38,452 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,463 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,520 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 82 treesize of output 65 [2018-04-11 16:08:38,522 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:38,522 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 32 [2018-04-11 16:08:38,522 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,533 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 32 treesize of output 18 [2018-04-11 16:08:38,533 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,539 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 16:08:38,589 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 17 variables, input treesize:555, output treesize:77 [2018-04-11 16:08:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:08:38,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:08:38,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 16:08:38,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 16:08:38,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 16:08:38,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2018-04-11 16:08:38,650 INFO L87 Difference]: Start difference. First operand 259 states and 303 transitions. Second operand 24 states. [2018-04-11 16:08:56,738 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 121 DAG size of output 96 [2018-04-11 16:09:07,561 WARN L151 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 170 DAG size of output 127 [2018-04-11 16:09:07,900 WARN L151 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 181 DAG size of output 134 [2018-04-11 16:09:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:09:17,521 INFO L93 Difference]: Finished difference Result 279 states and 327 transitions. [2018-04-11 16:09:17,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 16:09:17,521 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-04-11 16:09:17,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:09:17,522 INFO L225 Difference]: With dead ends: 279 [2018-04-11 16:09:17,522 INFO L226 Difference]: Without dead ends: 279 [2018-04-11 16:09:17,523 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=266, Invalid=1626, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 16:09:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-11 16:09:17,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2018-04-11 16:09:17,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-11 16:09:17,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 305 transitions. [2018-04-11 16:09:17,528 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 305 transitions. Word has length 50 [2018-04-11 16:09:17,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:09:17,528 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 305 transitions. [2018-04-11 16:09:17,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 16:09:17,529 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 305 transitions. [2018-04-11 16:09:17,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 16:09:17,529 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:09:17,529 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:09:17,529 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 16:09:17,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1015537919, now seen corresponding path program 1 times [2018-04-11 16:09:17,529 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:09:17,529 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:09:17,530 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:09:17,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:09:17,530 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:09:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:09:17,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:09:17,542 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:09:17,543 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:09:17,543 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:09:17,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:09:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:09:17,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:09:17,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:09:17,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:17,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:17,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 16:09:17,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:17,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:17,589 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-11 16:09:17,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:17,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:17,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 16:09:17,611 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-11 16:09:17,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:09:17,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:17,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:17,624 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-11 16:09:17,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 16:09:17,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:17,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:17,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:17,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-11 16:09:17,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 16:09:17,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:17,661 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-11 16:09:17,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:17,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:17,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 16:09:17,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:17,696 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-11 16:09:17,696 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:17,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:17,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:17,711 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-04-11 16:09:17,858 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset Int) (__U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base Int) (__U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset Int)) (let ((.cse1 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset 1)) (.cse2 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset 5)) (.cse3 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset 4))) (and (= (select |c_old(#valid)| __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) 0) (= |c_#memory_$Pointer$.offset| (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base|) __U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset) .cse3 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset)))) (store .cse0 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base (store (store (select .cse0 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse1 0) .cse2 0)))) (= |c_#memory_$Pointer$.base| (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base|) __U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse3 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base)))) (store .cse4 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base (store (store (select .cse4 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse1 0) .cse2 0))))))) is different from true [2018-04-11 16:09:17,995 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 74 DAG size of output 58 [2018-04-11 16:09:17,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:18,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:18,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:18,002 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-11 16:09:18,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:18,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 60 [2018-04-11 16:09:18,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-04-11 16:09:18,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:18,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 16:09:18,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:18,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:18,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-04-11 16:09:18,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-11 16:09:18,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:18,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 16:09:18,104 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:18,112 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:18,124 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:18,134 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-11 16:09:18,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 60 [2018-04-11 16:09:18,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-04-11 16:09:18,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:18,169 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-11 16:09:18,170 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:18,178 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:18,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-04-11 16:09:18,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-11 16:09:18,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:18,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 16:09:18,202 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:18,205 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:18,215 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:18,222 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-11 16:09:18,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:09:18,243 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:146, output treesize:165 [2018-04-11 16:09:23,092 WARN L148 SmtUtils]: Spent 2477ms on a formula simplification that was a NOOP. DAG size: 53 [2018-04-11 16:09:30,558 WARN L148 SmtUtils]: Spent 2436ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-11 16:09:55,546 WARN L148 SmtUtils]: Spent 2604ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-11 16:09:55,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 108 [2018-04-11 16:09:55,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:55,557 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:09:55,557 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 18 treesize of output 13 [2018-04-11 16:09:55,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:55,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:55,572 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2018-04-11 16:09:55,572 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-11 16:09:55,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:55,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-11 16:09:55,583 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:55,589 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-11 16:09:55,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-04-11 16:09:55,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:55,609 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 12 [2018-04-11 16:09:55,610 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:55,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:55,618 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 10 [2018-04-11 16:09:55,618 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:55,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:55,624 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:09:55,624 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 18 treesize of output 13 [2018-04-11 16:09:55,624 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:55,626 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:55,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:55,633 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:185, output treesize:7 [2018-04-11 16:09:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:09:55,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:09:55,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 16:09:55,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 16:09:55,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 16:09:55,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=318, Unknown=19, NotChecked=36, Total=420 [2018-04-11 16:09:55,693 INFO L87 Difference]: Start difference. First operand 263 states and 305 transitions. Second operand 21 states. [2018-04-11 16:11:19,599 WARN L148 SmtUtils]: Spent 2486ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-11 16:11:24,728 WARN L151 SmtUtils]: Spent 5098ms on a formula simplification. DAG size of input: 107 DAG size of output 79 [2018-04-11 16:11:29,723 WARN L151 SmtUtils]: Spent 4966ms on a formula simplification. DAG size of input: 108 DAG size of output 80 [2018-04-11 16:11:34,935 WARN L151 SmtUtils]: Spent 5179ms on a formula simplification. DAG size of input: 111 DAG size of output 83 [2018-04-11 16:11:40,246 WARN L151 SmtUtils]: Spent 5242ms on a formula simplification. DAG size of input: 115 DAG size of output 87 [2018-04-11 16:11:42,744 WARN L148 SmtUtils]: Spent 2471ms on a formula simplification that was a NOOP. DAG size: 75 Received shutdown request... [2018-04-11 16:11:57,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 16:11:57,006 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 16:11:57,010 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 16:11:57,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 04:11:57 BoogieIcfgContainer [2018-04-11 16:11:57,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 16:11:57,011 INFO L168 Benchmark]: Toolchain (without parser) took 214390.26 ms. Allocated memory was 404.8 MB in the beginning and 793.8 MB in the end (delta: 389.0 MB). Free memory was 339.5 MB in the beginning and 621.5 MB in the end (delta: -282.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 5.3 GB. [2018-04-11 16:11:57,012 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 404.8 MB. Free memory is still 363.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 16:11:57,012 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.22 ms. Allocated memory is still 404.8 MB. Free memory was 336.8 MB in the beginning and 311.7 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-11 16:11:57,012 INFO L168 Benchmark]: Boogie Preprocessor took 43.78 ms. Allocated memory is still 404.8 MB. Free memory was 311.7 MB in the beginning and 309.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 16:11:57,012 INFO L168 Benchmark]: RCFGBuilder took 475.42 ms. Allocated memory was 404.8 MB in the beginning and 595.6 MB in the end (delta: 190.8 MB). Free memory was 307.8 MB in the beginning and 514.4 MB in the end (delta: -206.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-11 16:11:57,012 INFO L168 Benchmark]: TraceAbstraction took 213618.33 ms. Allocated memory was 595.6 MB in the beginning and 793.8 MB in the end (delta: 198.2 MB). Free memory was 513.0 MB in the beginning and 621.5 MB in the end (delta: -108.5 MB). Peak memory consumption was 89.7 MB. Max. memory is 5.3 GB. [2018-04-11 16:11:57,013 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.13 ms. Allocated memory is still 404.8 MB. Free memory is still 363.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 250.22 ms. Allocated memory is still 404.8 MB. Free memory was 336.8 MB in the beginning and 311.7 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.78 ms. Allocated memory is still 404.8 MB. Free memory was 311.7 MB in the beginning and 309.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 475.42 ms. Allocated memory was 404.8 MB in the beginning and 595.6 MB in the end (delta: 190.8 MB). Free memory was 307.8 MB in the beginning and 514.4 MB in the end (delta: -206.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 213618.33 ms. Allocated memory was 595.6 MB in the beginning and 793.8 MB in the end (delta: 198.2 MB). Free memory was 513.0 MB in the beginning and 621.5 MB in the end (delta: -108.5 MB). Peak memory consumption was 89.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 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 (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 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 (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 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 (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 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 (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 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 (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 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 (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 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 (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 575]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 576]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 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 (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 582]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 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 (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 575]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 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 (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 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 (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 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 (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 583]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 583]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 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 (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 582]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 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 (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 576]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (263states) and interpolant automaton (currently 26 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 145 locations, 55 error locations. TIMEOUT Result, 213.5s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 166.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1721 SDtfs, 1603 SDslu, 5889 SDs, 0 SdLazy, 6173 SolverSat, 256 SolverUnsat, 105 SolverUnknown, 0 SolverNotchecked, 104.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 254 SyntacticMatches, 4 SemanticMatches, 238 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 89.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 358 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 46.2s InterpolantComputationTime, 884 NumberOfCodeBlocks, 884 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 484 ConstructedInterpolants, 169 QuantifiedInterpolants, 627860 SizeOfPredicates, 125 NumberOfNonLiveVariables, 1986 ConjunctsInSsa, 374 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 6/45 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_16-11-57-026.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_16-11-57-026.csv Completed graceful shutdown