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/960521-1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:33:32,180 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:33:32,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:33:32,193 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:33:32,193 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:33:32,194 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:33:32,195 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:33:32,196 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:33:32,198 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:33:32,198 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:33:32,199 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:33:32,199 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:33:32,200 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:33:32,201 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:33:32,202 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:33:32,203 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:33:32,205 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:33:32,206 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:33:32,207 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:33:32,208 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:33:32,209 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:33:32,210 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:33:32,210 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:33:32,211 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:33:32,211 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:33:32,212 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:33:32,212 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:33:32,213 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:33:32,213 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:33:32,213 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:33:32,214 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:33:32,214 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 15:33:32,234 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:33:32,234 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:33:32,235 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:33:32,235 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:33:32,235 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:33:32,235 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:33:32,235 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:33:32,235 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:33:32,235 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:33:32,235 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:33:32,236 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:33:32,236 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:33:32,236 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:33:32,236 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:33:32,236 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:33:32,236 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:33:32,236 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:33:32,236 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:33:32,236 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:33:32,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:33:32,237 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:33:32,237 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:33:32,237 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:33:32,237 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 15:33:32,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:33:32,275 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:33:32,278 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:33:32,280 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:33:32,280 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:33:32,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i [2018-04-11 15:33:32,600 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG380e67c42 [2018-04-11 15:33:32,722 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:33:32,723 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:33:32,724 INFO L168 CDTParser]: Scanning 960521-1_false-valid-free.i [2018-04-11 15:33:32,731 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:33:32,731 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:33:32,731 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:33:32,731 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_f_________false_valid_free_i__foo ('foo') in 960521-1_false-valid-free.i [2018-04-11 15:33:32,732 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in 960521-1_false-valid-free.i [2018-04-11 15:33:32,732 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:33:32,732 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__caddr_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,732 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____rlim_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,732 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__mode_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,732 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_int in 960521-1_false-valid-free.i [2018-04-11 15:33:32,732 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__div_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,732 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_mutex_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,732 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____int32_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__fsblkcnt_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fsfilcnt_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_mutexattr_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____rlim64_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____suseconds_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____time_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____ssize_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____dev_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____blksize_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__int32_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____qaddr_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____caddr_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__fd_set in 960521-1_false-valid-free.i [2018-04-11 15:33:32,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____timer_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____id_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____blkcnt64_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pid_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__fsfilcnt_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____u_short in 960521-1_false-valid-free.i [2018-04-11 15:33:32,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__key_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_int32_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____nlink_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__blkcnt_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____pthread_list_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_char in 960521-1_false-valid-free.i [2018-04-11 15:33:32,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__ulong in 960521-1_false-valid-free.i [2018-04-11 15:33:32,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____int16_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_once_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____u_long in 960521-1_false-valid-free.i [2018-04-11 15:33:32,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__gid_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fsblkcnt64_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____off64_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_short in 960521-1_false-valid-free.i [2018-04-11 15:33:32,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____quad_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__int16_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__lldiv_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____u_char in 960521-1_false-valid-free.i [2018-04-11 15:33:32,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____mode_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__blksize_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____u_quad_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__wchar_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____intptr_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____uint32_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_barrier_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__size_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__off_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_attr_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__uid_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____socklen_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____clockid_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__quad_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____daddr_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_spinlock_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__fsid_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_int16_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_cond_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__int64_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____key_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____blkcnt_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____clock_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__fd_mask in 960521-1_false-valid-free.i [2018-04-11 15:33:32,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__dev_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____WAIT_STATUS in 960521-1_false-valid-free.i [2018-04-11 15:33:32,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__ushort in 960521-1_false-valid-free.i [2018-04-11 15:33:32,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__id_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____uint8_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__uint in 960521-1_false-valid-free.i [2018-04-11 15:33:32,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____sigset_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__loff_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____ino_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____ino64_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____pid_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____off_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fd_mask in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____uint16_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____gid_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fsid_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__nlink_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__clock_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_condattr_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_rwlockattr_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_long in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__suseconds_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_int8_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____loff_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__daddr_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____sig_atomic_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__clockid_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__timer_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____int8_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_barrierattr_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__register_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__sigset_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____uint64_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____swblk_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_quad_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__ldiv_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____uid_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__ssize_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_int64_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fsblkcnt_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____int64_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__int8_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__n in 960521-1_false-valid-free.i [2018-04-11 15:33:32,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fsfilcnt64_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__ino_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____u_int in 960521-1_false-valid-free.i [2018-04-11 15:33:32,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____useconds_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__a in 960521-1_false-valid-free.i [2018-04-11 15:33:32,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__b in 960521-1_false-valid-free.i [2018-04-11 15:33:32,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__time_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_rwlock_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_key_t in 960521-1_false-valid-free.i [2018-04-11 15:33:32,756 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG380e67c42 [2018-04-11 15:33:32,759 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:33:32,760 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:33:32,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:33:32,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:33:32,765 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:33:32,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:33:32" (1/1) ... [2018-04-11 15:33:32,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5d46a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:33:32, skipping insertion in model container [2018-04-11 15:33:32,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:33:32" (1/1) ... [2018-04-11 15:33:32,779 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:33:32,801 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:33:32,919 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:33:32,952 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:33:32,957 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 111 non ball SCCs. Number of states in SCCs 111. [2018-04-11 15:33:32,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:33:32 WrapperNode [2018-04-11 15:33:32,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:33:32,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:33:32,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:33:32,987 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:33:32,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:33:32" (1/1) ... [2018-04-11 15:33:32,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:33:32" (1/1) ... [2018-04-11 15:33:33,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:33:32" (1/1) ... [2018-04-11 15:33:33,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:33:32" (1/1) ... [2018-04-11 15:33:33,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:33:32" (1/1) ... [2018-04-11 15:33:33,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:33:32" (1/1) ... [2018-04-11 15:33:33,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:33:32" (1/1) ... [2018-04-11 15:33:33,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:33:33,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:33:33,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:33:33,022 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:33:33,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:33:32" (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 15:33:33,114 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:33:33,114 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:33:33,114 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_________false_valid_free_i__foo [2018-04-11 15:33:33,114 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:33:33,114 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 15:33:33,114 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:33:33,114 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:33:33,114 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:33:33,114 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:33:33,115 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:33:33,115 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:33:33,115 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:33:33,115 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:33:33,115 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:33:33,115 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:33:33,115 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:33:33,115 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:33:33,115 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:33:33,115 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:33:33,115 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:33:33,115 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:33:33,115 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:33:33,115 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:33:33,115 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:33:33,116 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:33:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:33:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:33:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:33:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:33:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:33:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:33:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:33:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:33:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:33:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:33:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:33:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:33:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:33:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:33:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:33:33,117 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:33:33,118 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:33:33,119 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_________false_valid_free_i__foo [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:33:33,120 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:33:33,121 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:33:33,121 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:33:33,121 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:33:33,399 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:33:33,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:33:33 BoogieIcfgContainer [2018-04-11 15:33:33,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:33:33,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:33:33,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:33:33,402 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:33:33,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:33:32" (1/3) ... [2018-04-11 15:33:33,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@859f901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:33:33, skipping insertion in model container [2018-04-11 15:33:33,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:33:32" (2/3) ... [2018-04-11 15:33:33,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@859f901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:33:33, skipping insertion in model container [2018-04-11 15:33:33,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:33:33" (3/3) ... [2018-04-11 15:33:33,404 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-free.i [2018-04-11 15:33:33,410 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:33:33,415 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-04-11 15:33:33,438 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:33:33,438 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:33:33,438 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:33:33,439 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:33:33,439 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:33:33,439 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:33:33,439 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:33:33,439 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:33:33,439 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:33:33,439 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:33:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-04-11 15:33:33,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 15:33:33,455 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:33,455 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:33:33,456 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:33,458 INFO L82 PathProgramCache]: Analyzing trace with hash 516560539, now seen corresponding path program 1 times [2018-04-11 15:33:33,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:33,460 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:33,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:33,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:33,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:33,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:33,583 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 15:33:33,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:33:33,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:33:33,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:33:33,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:33:33,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:33:33,598 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-04-11 15:33:33,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:33,675 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-04-11 15:33:33,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:33:33,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-04-11 15:33:33,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:33,688 INFO L225 Difference]: With dead ends: 60 [2018-04-11 15:33:33,688 INFO L226 Difference]: Without dead ends: 57 [2018-04-11 15:33:33,690 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 15:33:33,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-11 15:33:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-04-11 15:33:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-11 15:33:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-04-11 15:33:33,716 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 11 [2018-04-11 15:33:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:33,716 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-04-11 15:33:33,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:33:33,716 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-04-11 15:33:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 15:33:33,717 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:33,717 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:33:33,717 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:33,717 INFO L82 PathProgramCache]: Analyzing trace with hash 516560540, now seen corresponding path program 1 times [2018-04-11 15:33:33,717 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:33,718 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:33,718 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:33,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:33,719 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:33,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:33,782 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 15:33:33,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:33:33,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:33:33,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:33:33,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:33:33,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:33:33,785 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2018-04-11 15:33:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:33,849 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-04-11 15:33:33,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:33:33,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-04-11 15:33:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:33,850 INFO L225 Difference]: With dead ends: 56 [2018-04-11 15:33:33,850 INFO L226 Difference]: Without dead ends: 56 [2018-04-11 15:33:33,851 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:33:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-04-11 15:33:33,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-04-11 15:33:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 15:33:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-04-11 15:33:33,855 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 11 [2018-04-11 15:33:33,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:33,855 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-04-11 15:33:33,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:33:33,855 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-04-11 15:33:33,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 15:33:33,856 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:33,856 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:33:33,856 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:33,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1337247429, now seen corresponding path program 1 times [2018-04-11 15:33:33,856 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:33,857 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:33,857 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:33,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:33,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:33,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:33,878 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:33:33,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:33,878 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:33,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:33,917 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:33,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:33:33,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:33,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:33:33,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:33:33,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:33:33,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:33:33,954 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 15:33:33,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:33,959 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 15:33:33,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 15:33:33,975 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 15:33:33,976 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:33:33,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:33:33,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:33:33,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:33:33,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:33:33,977 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 5 states. [2018-04-11 15:33:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:34,056 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-04-11 15:33:34,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:33:34,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-11 15:33:34,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:34,057 INFO L225 Difference]: With dead ends: 53 [2018-04-11 15:33:34,057 INFO L226 Difference]: Without dead ends: 53 [2018-04-11 15:33:34,057 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:33:34,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-11 15:33:34,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-04-11 15:33:34,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-11 15:33:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-04-11 15:33:34,061 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 17 [2018-04-11 15:33:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:34,062 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-04-11 15:33:34,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:33:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-04-11 15:33:34,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 15:33:34,063 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:34,063 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:33:34,063 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:34,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1337247430, now seen corresponding path program 1 times [2018-04-11 15:33:34,063 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:34,063 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:34,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:34,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:34,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:34,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:34,081 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:33:34,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:34,082 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:34,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:34,112 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:34,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:33:34,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:34,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:33:34,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:34,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:33:34,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-11 15:33:34,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:33:34,167 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 19 [2018-04-11 15:33:34,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:34,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:33:34,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:33:34,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 15:33:34,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:34,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:33:34,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-04-11 15:33:34,276 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 15:33:34,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:33:34,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:33:34,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:33:34,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:33:34,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:33:34,278 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 7 states. [2018-04-11 15:33:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:34,494 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-04-11 15:33:34,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:33:34,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-04-11 15:33:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:34,495 INFO L225 Difference]: With dead ends: 61 [2018-04-11 15:33:34,495 INFO L226 Difference]: Without dead ends: 61 [2018-04-11 15:33:34,496 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:33:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-04-11 15:33:34,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2018-04-11 15:33:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 15:33:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-04-11 15:33:34,499 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 17 [2018-04-11 15:33:34,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:34,500 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-04-11 15:33:34,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:33:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-04-11 15:33:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 15:33:34,500 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:34,500 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:33:34,500 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:34,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1186083357, now seen corresponding path program 1 times [2018-04-11 15:33:34,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:34,500 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:34,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:34,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:34,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:34,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:34,526 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:33:34,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:34,526 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:34,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:34,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:34,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:33:34,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:34,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:33:34,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:34,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:33:34,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-11 15:33:34,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:33:34,640 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 19 [2018-04-11 15:33:34,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:34,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:33:34,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:33:34,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:33:34,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:34,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:33:34,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-04-11 15:33:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:33:34,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:33:34,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 15:33:34,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:33:34,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:33:34,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:33:34,728 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 9 states. [2018-04-11 15:33:34,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:34,992 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-04-11 15:33:34,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:33:34,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-11 15:33:34,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:34,992 INFO L225 Difference]: With dead ends: 65 [2018-04-11 15:33:34,992 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 15:33:34,993 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:33:34,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 15:33:34,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-04-11 15:33:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 15:33:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-04-11 15:33:34,998 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 21 [2018-04-11 15:33:34,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:34,998 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-04-11 15:33:34,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:33:34,998 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-04-11 15:33:34,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:33:34,999 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:34,999 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:33:34,999 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:34,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1607211508, now seen corresponding path program 2 times [2018-04-11 15:33:34,999 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:34,999 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:35,000 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:35,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:35,000 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:35,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:35,018 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:33:35,018 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:35,018 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:35,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:33:35,047 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:33:35,047 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:35,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:35,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:33:35,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:35,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:33:35,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:35,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:33:35,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-11 15:33:35,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:33:35,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 19 [2018-04-11 15:33:35,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:35,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:33:35,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:33:35,090 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 15:33:35,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:35,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:33:35,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-04-11 15:33:35,178 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 15:33:35,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:33:35,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 15:33:35,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:33:35,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:33:35,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:33:35,179 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 9 states. [2018-04-11 15:33:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:35,485 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-04-11 15:33:35,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:33:35,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-04-11 15:33:35,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:35,485 INFO L225 Difference]: With dead ends: 81 [2018-04-11 15:33:35,485 INFO L226 Difference]: Without dead ends: 81 [2018-04-11 15:33:35,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:33:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-11 15:33:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-04-11 15:33:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-11 15:33:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-04-11 15:33:35,488 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 25 [2018-04-11 15:33:35,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:35,488 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-04-11 15:33:35,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:33:35,488 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-04-11 15:33:35,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:33:35,489 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:35,489 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:33:35,489 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:35,489 INFO L82 PathProgramCache]: Analyzing trace with hash 124796491, now seen corresponding path program 3 times [2018-04-11 15:33:35,489 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:35,489 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:35,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:35,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:35,490 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:35,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:35,501 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:33:35,501 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:35,501 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:35,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:33:35,514 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-04-11 15:33:35,514 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:35,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:35,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:33:35,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:35,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:33:35,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:35,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:33:35,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-11 15:33:35,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:33:35,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-04-11 15:33:35,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:35,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:33:35,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:33:35,565 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 15:33:35,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:35,569 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 15:33:35,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-11 15:33:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-11 15:33:35,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:33:35,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 15:33:35,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:33:35,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:33:35,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:33:35,640 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 9 states. [2018-04-11 15:33:35,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:35,851 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-04-11 15:33:35,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:33:35,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-04-11 15:33:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:35,852 INFO L225 Difference]: With dead ends: 73 [2018-04-11 15:33:35,852 INFO L226 Difference]: Without dead ends: 73 [2018-04-11 15:33:35,852 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:33:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-11 15:33:35,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2018-04-11 15:33:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-11 15:33:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-04-11 15:33:35,854 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 29 [2018-04-11 15:33:35,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:35,855 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-04-11 15:33:35,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:33:35,855 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-04-11 15:33:35,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:33:35,855 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:35,855 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:33:35,855 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:35,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1631061243, now seen corresponding path program 1 times [2018-04-11 15:33:35,855 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:35,855 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:35,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:35,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:35,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:35,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-04-11 15:33:35,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:33:35,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:33:35,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:33:35,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:33:35,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:33:35,891 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 4 states. [2018-04-11 15:33:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:35,915 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-04-11 15:33:35,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:33:35,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-04-11 15:33:35,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:35,917 INFO L225 Difference]: With dead ends: 68 [2018-04-11 15:33:35,917 INFO L226 Difference]: Without dead ends: 68 [2018-04-11 15:33:35,917 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 15:33:35,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-11 15:33:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-04-11 15:33:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-11 15:33:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-04-11 15:33:35,920 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 32 [2018-04-11 15:33:35,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:35,920 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-04-11 15:33:35,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:33:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-04-11 15:33:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:33:35,921 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:35,921 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:33:35,921 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:35,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1631061242, now seen corresponding path program 1 times [2018-04-11 15:33:35,921 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:35,921 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:35,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:35,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:35,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:35,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:33:35,974 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:35,974 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:35,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:35,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:33:36,018 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:36,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-04-11 15:33:36,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:33:36,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:33:36,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:33:36,019 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 11 states. [2018-04-11 15:33:36,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:36,058 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-04-11 15:33:36,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:33:36,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-04-11 15:33:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:36,059 INFO L225 Difference]: With dead ends: 84 [2018-04-11 15:33:36,059 INFO L226 Difference]: Without dead ends: 84 [2018-04-11 15:33:36,059 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:33:36,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-11 15:33:36,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2018-04-11 15:33:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-11 15:33:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-04-11 15:33:36,063 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 32 [2018-04-11 15:33:36,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:36,063 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-04-11 15:33:36,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:33:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-04-11 15:33:36,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:33:36,064 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:36,064 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:33:36,064 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:36,064 INFO L82 PathProgramCache]: Analyzing trace with hash -830892337, now seen corresponding path program 2 times [2018-04-11 15:33:36,065 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:36,065 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:36,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:36,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:36,066 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:36,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:33:36,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:36,128 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:36,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:33:36,138 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-11 15:33:36,139 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:36,141 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:36,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:33:36,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:36,147 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 15:33:36,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-11 15:33:36,205 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-04-11 15:33:36,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:33:36,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-04-11 15:33:36,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:33:36,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:33:36,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:33:36,207 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 12 states. [2018-04-11 15:33:36,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:36,495 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-04-11 15:33:36,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:33:36,495 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-04-11 15:33:36,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:36,497 INFO L225 Difference]: With dead ends: 84 [2018-04-11 15:33:36,497 INFO L226 Difference]: Without dead ends: 84 [2018-04-11 15:33:36,497 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:33:36,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-11 15:33:36,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2018-04-11 15:33:36,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-11 15:33:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-04-11 15:33:36,500 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 36 [2018-04-11 15:33:36,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:36,500 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-04-11 15:33:36,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:33:36,500 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-04-11 15:33:36,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:33:36,500 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:36,500 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:33:36,500 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:36,501 INFO L82 PathProgramCache]: Analyzing trace with hash -21492497, now seen corresponding path program 1 times [2018-04-11 15:33:36,501 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:36,501 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:36,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:36,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:36,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:36,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 15:33:36,548 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:36,548 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:36,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:36,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 15:33:36,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:36,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-04-11 15:33:36,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:33:36,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:33:36,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:33:36,607 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 15 states. [2018-04-11 15:33:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:36,708 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-04-11 15:33:36,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:33:36,709 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-04-11 15:33:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:36,709 INFO L225 Difference]: With dead ends: 91 [2018-04-11 15:33:36,709 INFO L226 Difference]: Without dead ends: 91 [2018-04-11 15:33:36,710 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:33:36,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-11 15:33:36,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2018-04-11 15:33:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-11 15:33:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-04-11 15:33:36,713 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 44 [2018-04-11 15:33:36,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:36,714 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-04-11 15:33:36,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:33:36,714 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-04-11 15:33:36,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 15:33:36,714 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:36,715 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:33:36,715 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:36,715 INFO L82 PathProgramCache]: Analyzing trace with hash -960937160, now seen corresponding path program 2 times [2018-04-11 15:33:36,715 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:36,715 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:36,716 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:36,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:36,716 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:36,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 15:33:36,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:36,792 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:36,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:33:36,818 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:33:36,818 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:36,821 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:36,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:33:36,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:36,834 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 15:33:36,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-11 15:33:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-04-11 15:33:36,943 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:33:36,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-04-11 15:33:36,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:33:36,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:33:36,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:33:36,944 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 15 states. [2018-04-11 15:33:37,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:37,400 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-04-11 15:33:37,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:33:37,401 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-04-11 15:33:37,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:37,402 INFO L225 Difference]: With dead ends: 95 [2018-04-11 15:33:37,402 INFO L226 Difference]: Without dead ends: 95 [2018-04-11 15:33:37,402 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=280, Invalid=712, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:33:37,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-11 15:33:37,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2018-04-11 15:33:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-11 15:33:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-04-11 15:33:37,406 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 48 [2018-04-11 15:33:37,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:37,406 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-04-11 15:33:37,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:33:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-04-11 15:33:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 15:33:37,416 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:37,416 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:33:37,416 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:37,416 INFO L82 PathProgramCache]: Analyzing trace with hash 568412717, now seen corresponding path program 1 times [2018-04-11 15:33:37,416 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:37,416 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:37,417 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:37,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:37,417 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:37,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-04-11 15:33:37,530 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:37,530 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:37,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:37,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-04-11 15:33:37,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:37,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-04-11 15:33:37,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:33:37,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:33:37,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:33:37,631 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 20 states. [2018-04-11 15:33:37,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:37,736 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-04-11 15:33:37,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:33:37,736 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-04-11 15:33:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:37,736 INFO L225 Difference]: With dead ends: 101 [2018-04-11 15:33:37,737 INFO L226 Difference]: Without dead ends: 101 [2018-04-11 15:33:37,737 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=265, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:33:37,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-11 15:33:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-04-11 15:33:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-11 15:33:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-04-11 15:33:37,739 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 79 [2018-04-11 15:33:37,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:37,740 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-04-11 15:33:37,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:33:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-04-11 15:33:37,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-04-11 15:33:37,741 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:37,741 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 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 15:33:37,741 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:37,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1423474090, now seen corresponding path program 2 times [2018-04-11 15:33:37,742 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:37,742 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:37,742 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:37,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:37,742 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:37,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-04-11 15:33:37,860 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:37,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:37,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:33:37,884 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:33:37,884 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:37,888 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-04-11 15:33:37,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:37,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2018-04-11 15:33:37,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:33:37,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:33:37,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:33:37,912 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 14 states. [2018-04-11 15:33:38,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:38,040 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-04-11 15:33:38,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:33:38,040 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2018-04-11 15:33:38,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:38,041 INFO L225 Difference]: With dead ends: 109 [2018-04-11 15:33:38,041 INFO L226 Difference]: Without dead ends: 109 [2018-04-11 15:33:38,042 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=327, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:33:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-11 15:33:38,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-04-11 15:33:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-11 15:33:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-04-11 15:33:38,045 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 91 [2018-04-11 15:33:38,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:38,045 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-04-11 15:33:38,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:33:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-04-11 15:33:38,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-11 15:33:38,046 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:38,046 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 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 15:33:38,046 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:38,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1022800842, now seen corresponding path program 3 times [2018-04-11 15:33:38,047 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:38,047 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:38,047 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:38,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:38,048 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:38,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-04-11 15:33:38,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:38,168 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:38,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:33:38,201 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-11 15:33:38,202 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:38,207 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-04-11 15:33:38,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:38,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2018-04-11 15:33:38,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:33:38,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:33:38,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:33:38,224 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 15 states. [2018-04-11 15:33:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:38,398 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-04-11 15:33:38,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:33:38,398 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 99 [2018-04-11 15:33:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:38,399 INFO L225 Difference]: With dead ends: 117 [2018-04-11 15:33:38,399 INFO L226 Difference]: Without dead ends: 117 [2018-04-11 15:33:38,399 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=213, Invalid=387, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:33:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-11 15:33:38,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-04-11 15:33:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-11 15:33:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-04-11 15:33:38,401 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 99 [2018-04-11 15:33:38,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:38,402 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-04-11 15:33:38,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:33:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-04-11 15:33:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-04-11 15:33:38,402 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:38,403 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 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 15:33:38,403 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:38,403 INFO L82 PathProgramCache]: Analyzing trace with hash 282730262, now seen corresponding path program 4 times [2018-04-11 15:33:38,403 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:38,403 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:38,403 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:38,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:38,403 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:38,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-04-11 15:33:38,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:38,547 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:38,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:33:38,577 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:33:38,578 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:38,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:38,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:33:38,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:38,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:33:38,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:33:38,958 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 200 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:33:38,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:38,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26] total 39 [2018-04-11 15:33:38,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 15:33:38,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 15:33:38,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1144, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:33:38,959 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 39 states. [2018-04-11 15:33:39,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:39,221 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2018-04-11 15:33:39,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:33:39,221 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 107 [2018-04-11 15:33:39,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:39,222 INFO L225 Difference]: With dead ends: 125 [2018-04-11 15:33:39,222 INFO L226 Difference]: Without dead ends: 125 [2018-04-11 15:33:39,222 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=2161, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 15:33:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-11 15:33:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2018-04-11 15:33:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-11 15:33:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-04-11 15:33:39,224 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 107 [2018-04-11 15:33:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:39,224 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-04-11 15:33:39,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 15:33:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-04-11 15:33:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-04-11 15:33:39,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:39,225 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 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 15:33:39,225 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:39,225 INFO L82 PathProgramCache]: Analyzing trace with hash 233077494, now seen corresponding path program 5 times [2018-04-11 15:33:39,225 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:39,225 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:39,225 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:39,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:39,226 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:39,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-04-11 15:33:39,364 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:39,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:39,365 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:33:39,416 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-11 15:33:39,416 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:39,420 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-04-11 15:33:39,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:39,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 17 [2018-04-11 15:33:39,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:33:39,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:33:39,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:33:39,439 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 17 states. [2018-04-11 15:33:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:39,623 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-04-11 15:33:39,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:33:39,623 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 115 [2018-04-11 15:33:39,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:39,624 INFO L225 Difference]: With dead ends: 133 [2018-04-11 15:33:39,624 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 15:33:39,624 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=290, Invalid=522, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:33:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 15:33:39,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-04-11 15:33:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 15:33:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-04-11 15:33:39,626 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 115 [2018-04-11 15:33:39,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:39,626 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-04-11 15:33:39,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:33:39,626 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-04-11 15:33:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-04-11 15:33:39,627 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:39,627 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 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 15:33:39,627 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:39,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1556946986, now seen corresponding path program 6 times [2018-04-11 15:33:39,627 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:39,627 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:39,628 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:39,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:39,628 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:39,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-04-11 15:33:39,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:39,823 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:39,823 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:33:39,847 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-11 15:33:39,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:39,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-04-11 15:33:39,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:39,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 18 [2018-04-11 15:33:39,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:33:39,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:33:39,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:33:39,863 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 18 states. [2018-04-11 15:33:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:40,068 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-04-11 15:33:40,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:33:40,068 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 123 [2018-04-11 15:33:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:40,069 INFO L225 Difference]: With dead ends: 141 [2018-04-11 15:33:40,069 INFO L226 Difference]: Without dead ends: 141 [2018-04-11 15:33:40,070 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=333, Invalid=597, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:33:40,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-11 15:33:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2018-04-11 15:33:40,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-11 15:33:40,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-04-11 15:33:40,073 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 123 [2018-04-11 15:33:40,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:40,073 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-04-11 15:33:40,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:33:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-04-11 15:33:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-04-11 15:33:40,075 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:40,075 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 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 15:33:40,075 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:40,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1234161078, now seen corresponding path program 7 times [2018-04-11 15:33:40,075 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:40,075 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:40,076 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:40,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:40,076 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:40,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-04-11 15:33:40,251 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:40,252 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:40,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:40,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-04-11 15:33:40,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:40,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2018-04-11 15:33:40,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 15:33:40,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 15:33:40,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=631, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:33:40,453 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 32 states. [2018-04-11 15:33:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:40,585 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-04-11 15:33:40,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:33:40,586 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 131 [2018-04-11 15:33:40,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:40,586 INFO L225 Difference]: With dead ends: 149 [2018-04-11 15:33:40,587 INFO L226 Difference]: Without dead ends: 149 [2018-04-11 15:33:40,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=392, Invalid=664, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:33:40,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-11 15:33:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2018-04-11 15:33:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-11 15:33:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-04-11 15:33:40,590 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 131 [2018-04-11 15:33:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:40,590 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-04-11 15:33:40,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 15:33:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-04-11 15:33:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-04-11 15:33:40,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:40,591 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 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 15:33:40,592 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:40,592 INFO L82 PathProgramCache]: Analyzing trace with hash 696632470, now seen corresponding path program 8 times [2018-04-11 15:33:40,592 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:40,592 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:40,593 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:40,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:40,593 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:40,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-04-11 15:33:40,859 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:40,859 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:40,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:33:40,878 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:33:40,879 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:40,881 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-04-11 15:33:40,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:40,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 20 [2018-04-11 15:33:40,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:33:40,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:33:40,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:33:40,905 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 20 states. [2018-04-11 15:33:41,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:41,128 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-04-11 15:33:41,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:33:41,128 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 139 [2018-04-11 15:33:41,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:41,129 INFO L225 Difference]: With dead ends: 157 [2018-04-11 15:33:41,129 INFO L226 Difference]: Without dead ends: 157 [2018-04-11 15:33:41,129 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=428, Invalid=762, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:33:41,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-04-11 15:33:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2018-04-11 15:33:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 15:33:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-04-11 15:33:41,132 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 139 [2018-04-11 15:33:41,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:41,132 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-04-11 15:33:41,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:33:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-04-11 15:33:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-04-11 15:33:41,133 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:41,134 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 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 15:33:41,134 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:41,134 INFO L82 PathProgramCache]: Analyzing trace with hash 996099190, now seen corresponding path program 9 times [2018-04-11 15:33:41,134 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:41,134 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:41,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:41,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:41,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:41,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-04-11 15:33:41,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:41,319 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:41,319 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:33:41,360 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-11 15:33:41,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:41,366 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-04-11 15:33:41,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:41,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2018-04-11 15:33:41,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 15:33:41,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 15:33:41,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=800, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:33:41,527 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 36 states. [2018-04-11 15:33:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:41,657 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-04-11 15:33:41,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:33:41,657 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 147 [2018-04-11 15:33:41,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:41,658 INFO L225 Difference]: With dead ends: 165 [2018-04-11 15:33:41,658 INFO L226 Difference]: Without dead ends: 165 [2018-04-11 15:33:41,658 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=495, Invalid=837, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:33:41,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-04-11 15:33:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2018-04-11 15:33:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-11 15:33:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-04-11 15:33:41,660 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 147 [2018-04-11 15:33:41,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:41,660 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-04-11 15:33:41,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 15:33:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-04-11 15:33:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-04-11 15:33:41,661 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:41,661 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 1, 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 15:33:41,661 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:41,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1730596182, now seen corresponding path program 10 times [2018-04-11 15:33:41,661 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:41,661 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:41,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:41,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:41,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:41,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-04-11 15:33:41,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:41,905 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:41,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:33:41,939 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:33:41,939 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:41,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:41,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:33:41,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:41,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:33:41,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:33:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 512 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:33:42,833 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:42,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 38] total 57 [2018-04-11 15:33:42,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-11 15:33:42,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-11 15:33:42,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=2470, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 15:33:42,835 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 57 states. [2018-04-11 15:33:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:43,463 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2018-04-11 15:33:43,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:33:43,463 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 155 [2018-04-11 15:33:43,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:43,464 INFO L225 Difference]: With dead ends: 173 [2018-04-11 15:33:43,464 INFO L226 Difference]: Without dead ends: 173 [2018-04-11 15:33:43,465 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1264, Invalid=4588, Unknown=0, NotChecked=0, Total=5852 [2018-04-11 15:33:43,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-11 15:33:43,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2018-04-11 15:33:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-11 15:33:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-04-11 15:33:43,467 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 155 [2018-04-11 15:33:43,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:43,467 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-04-11 15:33:43,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-11 15:33:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-04-11 15:33:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-04-11 15:33:43,468 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:43,468 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 1, 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 15:33:43,468 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:43,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1532567754, now seen corresponding path program 11 times [2018-04-11 15:33:43,468 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:43,468 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:43,469 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:43,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:43,469 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:43,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-04-11 15:33:43,650 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:43,650 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:43,650 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:33:43,694 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-11 15:33:43,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:43,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-04-11 15:33:43,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:43,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 23 [2018-04-11 15:33:43,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:33:43,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:33:43,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:33:43,714 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 23 states. [2018-04-11 15:33:43,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:43,964 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2018-04-11 15:33:43,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:33:43,964 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 163 [2018-04-11 15:33:43,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:43,965 INFO L225 Difference]: With dead ends: 181 [2018-04-11 15:33:43,965 INFO L226 Difference]: Without dead ends: 181 [2018-04-11 15:33:43,965 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=593, Invalid=1047, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:33:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-04-11 15:33:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2018-04-11 15:33:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-11 15:33:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-04-11 15:33:43,968 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 163 [2018-04-11 15:33:43,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:43,968 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-04-11 15:33:43,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:33:43,968 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-04-11 15:33:43,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-04-11 15:33:43,969 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:43,969 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 1, 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 15:33:43,969 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:43,969 INFO L82 PathProgramCache]: Analyzing trace with hash 459930134, now seen corresponding path program 12 times [2018-04-11 15:33:43,969 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:43,969 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:43,970 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:43,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:43,970 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:43,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-04-11 15:33:44,221 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:44,221 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:44,222 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:33:44,260 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-11 15:33:44,260 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:44,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-04-11 15:33:44,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:44,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2018-04-11 15:33:44,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 15:33:44,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 15:33:44,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=631, Invalid=1091, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 15:33:44,568 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 42 states. [2018-04-11 15:33:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:44,701 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-04-11 15:33:44,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:33:44,701 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 171 [2018-04-11 15:33:44,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:44,701 INFO L225 Difference]: With dead ends: 189 [2018-04-11 15:33:44,701 INFO L226 Difference]: Without dead ends: 189 [2018-04-11 15:33:44,702 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=672, Invalid=1134, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 15:33:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-11 15:33:44,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2018-04-11 15:33:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 15:33:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-04-11 15:33:44,704 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 171 [2018-04-11 15:33:44,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:44,704 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-04-11 15:33:44,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 15:33:44,704 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-04-11 15:33:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-04-11 15:33:44,704 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:44,705 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 1, 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 15:33:44,705 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:44,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1119526390, now seen corresponding path program 13 times [2018-04-11 15:33:44,705 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:44,705 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:44,705 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:44,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:44,705 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:44,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-04-11 15:33:44,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:44,929 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:44,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:44,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-04-11 15:33:45,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:45,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2018-04-11 15:33:45,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 15:33:45,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 15:33:45,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=1198, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:33:45,186 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 44 states. [2018-04-11 15:33:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:45,386 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-04-11 15:33:45,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:33:45,386 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 179 [2018-04-11 15:33:45,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:45,387 INFO L225 Difference]: With dead ends: 197 [2018-04-11 15:33:45,387 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 15:33:45,387 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=737, Invalid=1243, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:33:45,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 15:33:45,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2018-04-11 15:33:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-11 15:33:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-04-11 15:33:45,390 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 179 [2018-04-11 15:33:45,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:45,390 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-04-11 15:33:45,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 15:33:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-04-11 15:33:45,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-04-11 15:33:45,390 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:45,390 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 1, 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 15:33:45,390 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:45,391 INFO L82 PathProgramCache]: Analyzing trace with hash 27478742, now seen corresponding path program 14 times [2018-04-11 15:33:45,391 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:45,391 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:45,391 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:45,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:45,391 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:45,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-04-11 15:33:45,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:45,666 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:45,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:33:45,689 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:33:45,690 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:45,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-04-11 15:33:45,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:45,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 26 [2018-04-11 15:33:45,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:33:45,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:33:45,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:33:45,727 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 26 states. [2018-04-11 15:33:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:46,090 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2018-04-11 15:33:46,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:33:46,090 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 187 [2018-04-11 15:33:46,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:46,091 INFO L225 Difference]: With dead ends: 205 [2018-04-11 15:33:46,091 INFO L226 Difference]: Without dead ends: 205 [2018-04-11 15:33:46,092 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=785, Invalid=1377, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 15:33:46,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-11 15:33:46,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2018-04-11 15:33:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-11 15:33:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-04-11 15:33:46,095 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 187 [2018-04-11 15:33:46,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:46,095 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-04-11 15:33:46,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:33:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-04-11 15:33:46,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-04-11 15:33:46,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:46,096 INFO L355 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 1, 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 15:33:46,097 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:46,097 INFO L82 PathProgramCache]: Analyzing trace with hash -823230282, now seen corresponding path program 15 times [2018-04-11 15:33:46,097 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:46,097 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:46,097 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:46,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:46,098 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:46,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-04-11 15:33:46,478 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:46,478 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:46,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:33:46,527 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-11 15:33:46,527 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:46,534 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-04-11 15:33:46,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:46,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-04-11 15:33:46,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-11 15:33:46,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-11 15:33:46,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=829, Invalid=1427, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 15:33:46,815 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 48 states. [2018-04-11 15:33:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:46,975 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2018-04-11 15:33:46,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:33:46,975 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 195 [2018-04-11 15:33:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:46,976 INFO L225 Difference]: With dead ends: 213 [2018-04-11 15:33:46,976 INFO L226 Difference]: Without dead ends: 213 [2018-04-11 15:33:46,976 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=876, Invalid=1476, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:33:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-11 15:33:46,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2018-04-11 15:33:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-11 15:33:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-04-11 15:33:46,979 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 195 [2018-04-11 15:33:46,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:46,979 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-04-11 15:33:46,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-11 15:33:46,979 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-04-11 15:33:46,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-04-11 15:33:46,979 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:46,979 INFO L355 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 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 15:33:46,980 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:46,980 INFO L82 PathProgramCache]: Analyzing trace with hash -785989738, now seen corresponding path program 16 times [2018-04-11 15:33:46,980 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:46,980 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:46,980 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:46,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:46,980 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:46,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-04-11 15:33:47,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:47,247 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:47,247 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:33:47,273 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:33:47,273 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:47,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:47,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:33:47,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:47,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:33:47,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:33:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 968 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:33:48,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:48,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 50] total 75 [2018-04-11 15:33:48,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-11 15:33:48,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-11 15:33:48,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=4300, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 15:33:48,195 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 75 states. [2018-04-11 15:33:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:48,922 INFO L93 Difference]: Finished difference Result 221 states and 222 transitions. [2018-04-11 15:33:48,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:33:48,922 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 203 [2018-04-11 15:33:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:48,923 INFO L225 Difference]: With dead ends: 221 [2018-04-11 15:33:48,923 INFO L226 Difference]: Without dead ends: 221 [2018-04-11 15:33:48,926 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3837 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2185, Invalid=7915, Unknown=0, NotChecked=0, Total=10100 [2018-04-11 15:33:48,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-11 15:33:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2018-04-11 15:33:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-11 15:33:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-04-11 15:33:48,930 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 203 [2018-04-11 15:33:48,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:48,930 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-04-11 15:33:48,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-11 15:33:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-04-11 15:33:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-04-11 15:33:48,931 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:48,931 INFO L355 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 1, 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 15:33:48,931 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:48,932 INFO L82 PathProgramCache]: Analyzing trace with hash -23689354, now seen corresponding path program 17 times [2018-04-11 15:33:48,932 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:48,932 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:48,932 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:48,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:48,932 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:48,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2018-04-11 15:33:49,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:49,239 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:49,239 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:33:49,309 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-04-11 15:33:49,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:49,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2018-04-11 15:33:49,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:49,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 29 [2018-04-11 15:33:49,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:33:49,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:33:49,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:33:49,343 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 29 states. [2018-04-11 15:33:49,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:49,757 INFO L93 Difference]: Finished difference Result 229 states and 230 transitions. [2018-04-11 15:33:49,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:33:49,757 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 211 [2018-04-11 15:33:49,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:49,758 INFO L225 Difference]: With dead ends: 229 [2018-04-11 15:33:49,758 INFO L226 Difference]: Without dead ends: 229 [2018-04-11 15:33:49,758 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1004, Invalid=1752, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 15:33:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-11 15:33:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2018-04-11 15:33:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-11 15:33:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-04-11 15:33:49,761 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 211 [2018-04-11 15:33:49,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:49,761 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-04-11 15:33:49,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:33:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-04-11 15:33:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-04-11 15:33:49,762 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:49,763 INFO L355 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 1, 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 15:33:49,763 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:49,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1028151382, now seen corresponding path program 18 times [2018-04-11 15:33:49,763 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:49,763 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:49,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:49,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:49,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:49,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2018-04-11 15:33:50,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:50,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:50,106 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:33:50,161 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-04-11 15:33:50,161 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:50,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2018-04-11 15:33:50,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:50,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 54 [2018-04-11 15:33:50,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-11 15:33:50,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-11 15:33:50,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1054, Invalid=1808, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 15:33:50,537 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 54 states. [2018-04-11 15:33:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:50,753 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-04-11 15:33:50,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:33:50,753 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 219 [2018-04-11 15:33:50,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:50,754 INFO L225 Difference]: With dead ends: 237 [2018-04-11 15:33:50,754 INFO L226 Difference]: Without dead ends: 237 [2018-04-11 15:33:50,754 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1107, Invalid=1863, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 15:33:50,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-11 15:33:50,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2018-04-11 15:33:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-11 15:33:50,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-04-11 15:33:50,757 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 219 [2018-04-11 15:33:50,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:50,757 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-04-11 15:33:50,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-11 15:33:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-04-11 15:33:50,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-11 15:33:50,758 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:50,758 INFO L355 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 1, 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 15:33:50,758 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:50,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2096713162, now seen corresponding path program 19 times [2018-04-11 15:33:50,758 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:50,758 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:50,759 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:50,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:50,759 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:50,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2018-04-11 15:33:51,096 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:51,096 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:51,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:51,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2018-04-11 15:33:51,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:51,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 56 [2018-04-11 15:33:51,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-11 15:33:51,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-11 15:33:51,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=1945, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 15:33:51,423 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 56 states. [2018-04-11 15:33:51,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:51,632 INFO L93 Difference]: Finished difference Result 245 states and 246 transitions. [2018-04-11 15:33:51,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:33:51,632 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 227 [2018-04-11 15:33:51,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:51,633 INFO L225 Difference]: With dead ends: 245 [2018-04-11 15:33:51,633 INFO L226 Difference]: Without dead ends: 245 [2018-04-11 15:33:51,634 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1190, Invalid=2002, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 15:33:51,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-04-11 15:33:51,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 241. [2018-04-11 15:33:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-11 15:33:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-04-11 15:33:51,637 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 227 [2018-04-11 15:33:51,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:51,638 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-04-11 15:33:51,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-11 15:33:51,638 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-04-11 15:33:51,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-04-11 15:33:51,639 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:51,639 INFO L355 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 1, 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 15:33:51,639 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:51,639 INFO L82 PathProgramCache]: Analyzing trace with hash -178514666, now seen corresponding path program 20 times [2018-04-11 15:33:51,639 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:51,640 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:51,640 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:51,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:51,640 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:51,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2018-04-11 15:33:51,965 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:51,965 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:51,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:33:51,984 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:33:51,984 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:51,987 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2018-04-11 15:33:52,029 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:52,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 32 [2018-04-11 15:33:52,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 15:33:52,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 15:33:52,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=553, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:33:52,030 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 32 states. [2018-04-11 15:33:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:52,500 INFO L93 Difference]: Finished difference Result 253 states and 254 transitions. [2018-04-11 15:33:52,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:33:52,500 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 235 [2018-04-11 15:33:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:52,501 INFO L225 Difference]: With dead ends: 253 [2018-04-11 15:33:52,501 INFO L226 Difference]: Without dead ends: 253 [2018-04-11 15:33:52,501 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1250, Invalid=2172, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:33:52,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-11 15:33:52,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2018-04-11 15:33:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-04-11 15:33:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-04-11 15:33:52,503 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 235 [2018-04-11 15:33:52,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:52,503 INFO L459 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-04-11 15:33:52,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 15:33:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-04-11 15:33:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-04-11 15:33:52,504 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:52,504 INFO L355 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 1, 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 15:33:52,504 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:52,504 INFO L82 PathProgramCache]: Analyzing trace with hash 160628982, now seen corresponding path program 21 times [2018-04-11 15:33:52,504 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:52,504 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:52,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:52,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:52,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:52,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2018-04-11 15:33:52,854 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:52,854 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:52,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:33:52,904 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-04-11 15:33:52,905 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:52,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2018-04-11 15:33:53,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:53,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 60 [2018-04-11 15:33:53,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-11 15:33:53,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-11 15:33:53,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1306, Invalid=2234, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 15:33:53,343 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 60 states. [2018-04-11 15:33:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:53,535 INFO L93 Difference]: Finished difference Result 261 states and 262 transitions. [2018-04-11 15:33:53,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:33:53,536 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 243 [2018-04-11 15:33:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:53,537 INFO L225 Difference]: With dead ends: 261 [2018-04-11 15:33:53,537 INFO L226 Difference]: Without dead ends: 261 [2018-04-11 15:33:53,537 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1365, Invalid=2295, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 15:33:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-11 15:33:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 257. [2018-04-11 15:33:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-04-11 15:33:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-04-11 15:33:53,540 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 243 [2018-04-11 15:33:53,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:53,540 INFO L459 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-04-11 15:33:53,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-11 15:33:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-04-11 15:33:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-04-11 15:33:53,541 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:53,541 INFO L355 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 1, 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 15:33:53,542 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:53,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1531578922, now seen corresponding path program 22 times [2018-04-11 15:33:53,542 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:53,542 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:53,543 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:53,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:53,543 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:53,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-04-11 15:33:54,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:54,048 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:54,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:33:54,106 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:33:54,106 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:54,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:54,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:33:54,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:54,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:33:54,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:33:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1568 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:33:55,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:55,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 62] total 93 [2018-04-11 15:33:55,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-11 15:33:55,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-11 15:33:55,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1922, Invalid=6634, Unknown=0, NotChecked=0, Total=8556 [2018-04-11 15:33:55,485 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 93 states. [2018-04-11 15:33:56,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:56,265 INFO L93 Difference]: Finished difference Result 269 states and 270 transitions. [2018-04-11 15:33:56,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 15:33:56,265 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 251 [2018-04-11 15:33:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:56,266 INFO L225 Difference]: With dead ends: 269 [2018-04-11 15:33:56,266 INFO L226 Difference]: Without dead ends: 269 [2018-04-11 15:33:56,267 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6057 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3358, Invalid=12142, Unknown=0, NotChecked=0, Total=15500 [2018-04-11 15:33:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-11 15:33:56,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265. [2018-04-11 15:33:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-11 15:33:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-04-11 15:33:56,270 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 251 [2018-04-11 15:33:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:56,271 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-04-11 15:33:56,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-11 15:33:56,271 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-04-11 15:33:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-04-11 15:33:56,272 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:56,272 INFO L355 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 1, 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 15:33:56,272 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:56,272 INFO L82 PathProgramCache]: Analyzing trace with hash 999257014, now seen corresponding path program 23 times [2018-04-11 15:33:56,272 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:56,272 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:56,272 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:56,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:56,273 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:56,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2018-04-11 15:33:56,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:56,689 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:56,689 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:33:56,740 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-04-11 15:33:56,740 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:56,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2018-04-11 15:33:56,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:56,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 35 [2018-04-11 15:33:56,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 15:33:56,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 15:33:56,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=658, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:33:56,822 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 35 states. [2018-04-11 15:33:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:57,260 INFO L93 Difference]: Finished difference Result 277 states and 278 transitions. [2018-04-11 15:33:57,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 15:33:57,261 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 259 [2018-04-11 15:33:57,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:57,261 INFO L225 Difference]: With dead ends: 277 [2018-04-11 15:33:57,262 INFO L226 Difference]: Without dead ends: 277 [2018-04-11 15:33:57,262 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1523, Invalid=2637, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 15:33:57,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-11 15:33:57,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2018-04-11 15:33:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-11 15:33:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-04-11 15:33:57,264 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 259 [2018-04-11 15:33:57,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:57,264 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-04-11 15:33:57,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 15:33:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-04-11 15:33:57,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-04-11 15:33:57,265 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:57,265 INFO L355 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 1, 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 15:33:57,265 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:57,265 INFO L82 PathProgramCache]: Analyzing trace with hash -223741290, now seen corresponding path program 24 times [2018-04-11 15:33:57,265 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:57,265 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:57,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:57,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:57,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:57,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:57,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2018-04-11 15:33:57,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:57,747 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:57,747 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:33:57,801 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-04-11 15:33:57,801 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:57,813 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:58,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2018-04-11 15:33:58,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:58,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 66 [2018-04-11 15:33:58,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-11 15:33:58,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-11 15:33:58,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1585, Invalid=2705, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 15:33:58,288 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 66 states. [2018-04-11 15:33:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:58,532 INFO L93 Difference]: Finished difference Result 285 states and 286 transitions. [2018-04-11 15:33:58,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 15:33:58,564 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 267 [2018-04-11 15:33:58,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:58,565 INFO L225 Difference]: With dead ends: 285 [2018-04-11 15:33:58,565 INFO L226 Difference]: Without dead ends: 285 [2018-04-11 15:33:58,566 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1888 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1650, Invalid=2772, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 15:33:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-04-11 15:33:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2018-04-11 15:33:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-04-11 15:33:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-04-11 15:33:58,568 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 267 [2018-04-11 15:33:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:58,568 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-04-11 15:33:58,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-11 15:33:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-04-11 15:33:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-04-11 15:33:58,569 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:58,569 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 1, 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 15:33:58,569 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1102050698, now seen corresponding path program 25 times [2018-04-11 15:33:58,570 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:58,570 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:58,570 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:58,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:58,570 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:58,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:33:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2018-04-11 15:33:59,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:59,033 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:59,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:59,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2018-04-11 15:33:59,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:59,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 68 [2018-04-11 15:33:59,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-11 15:33:59,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-11 15:33:59,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1684, Invalid=2872, Unknown=0, NotChecked=0, Total=4556 [2018-04-11 15:33:59,437 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 68 states. [2018-04-11 15:33:59,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:59,676 INFO L93 Difference]: Finished difference Result 293 states and 294 transitions. [2018-04-11 15:33:59,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 15:33:59,676 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 275 [2018-04-11 15:33:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:59,677 INFO L225 Difference]: With dead ends: 293 [2018-04-11 15:33:59,677 INFO L226 Difference]: Without dead ends: 293 [2018-04-11 15:33:59,677 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2013 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1751, Invalid=2941, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 15:33:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-11 15:33:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 289. [2018-04-11 15:33:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-04-11 15:33:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-04-11 15:33:59,681 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 275 [2018-04-11 15:33:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:59,681 INFO L459 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-04-11 15:33:59,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-11 15:33:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-04-11 15:33:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-04-11 15:33:59,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:59,683 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 1, 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 15:33:59,683 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:33:59,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2104745130, now seen corresponding path program 26 times [2018-04-11 15:33:59,683 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:59,683 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:59,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:59,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:59,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:59,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:00,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2018-04-11 15:34:00,282 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:00,282 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:00,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:34:00,306 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:34:00,306 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:00,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2018-04-11 15:34:00,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:00,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 38 [2018-04-11 15:34:00,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 15:34:00,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 15:34:00,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=772, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:34:00,344 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 38 states. [2018-04-11 15:34:00,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:00,821 INFO L93 Difference]: Finished difference Result 301 states and 302 transitions. [2018-04-11 15:34:00,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 15:34:00,821 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 283 [2018-04-11 15:34:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:00,822 INFO L225 Difference]: With dead ends: 301 [2018-04-11 15:34:00,822 INFO L226 Difference]: Without dead ends: 301 [2018-04-11 15:34:00,823 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1823, Invalid=3147, Unknown=0, NotChecked=0, Total=4970 [2018-04-11 15:34:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-04-11 15:34:00,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2018-04-11 15:34:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-11 15:34:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-04-11 15:34:00,825 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 283 [2018-04-11 15:34:00,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:00,825 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-04-11 15:34:00,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 15:34:00,825 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-04-11 15:34:00,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-04-11 15:34:00,826 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:00,826 INFO L355 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 1, 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 15:34:00,826 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:00,826 INFO L82 PathProgramCache]: Analyzing trace with hash 858309942, now seen corresponding path program 27 times [2018-04-11 15:34:00,826 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:00,826 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:00,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:00,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:00,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:00,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2018-04-11 15:34:01,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:01,599 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:01,600 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:34:01,640 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-04-11 15:34:01,640 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:01,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2018-04-11 15:34:01,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:01,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 39 [2018-04-11 15:34:01,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 15:34:01,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 15:34:01,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=812, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:34:01,704 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 39 states. [2018-04-11 15:34:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:02,350 INFO L93 Difference]: Finished difference Result 309 states and 310 transitions. [2018-04-11 15:34:02,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 15:34:02,351 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 291 [2018-04-11 15:34:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:02,351 INFO L225 Difference]: With dead ends: 309 [2018-04-11 15:34:02,351 INFO L226 Difference]: Without dead ends: 309 [2018-04-11 15:34:02,352 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1929, Invalid=3327, Unknown=0, NotChecked=0, Total=5256 [2018-04-11 15:34:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-04-11 15:34:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 305. [2018-04-11 15:34:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-04-11 15:34:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2018-04-11 15:34:02,354 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 291 [2018-04-11 15:34:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:02,354 INFO L459 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2018-04-11 15:34:02,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 15:34:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2018-04-11 15:34:02,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-04-11 15:34:02,355 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:02,355 INFO L355 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 1, 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 15:34:02,355 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash -206540778, now seen corresponding path program 28 times [2018-04-11 15:34:02,355 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:02,356 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:02,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:02,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:02,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:02,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2018-04-11 15:34:02,999 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:02,999 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:02,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:34:03,042 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:34:03,042 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:03,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:03,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:34:03,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:34:03,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:34:03,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:34:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2312 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:34:04,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:04,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 74] total 111 [2018-04-11 15:34:04,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-04-11 15:34:04,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-04-11 15:34:04,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2738, Invalid=9472, Unknown=0, NotChecked=0, Total=12210 [2018-04-11 15:34:04,885 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 111 states. [2018-04-11 15:34:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:05,946 INFO L93 Difference]: Finished difference Result 317 states and 318 transitions. [2018-04-11 15:34:05,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-11 15:34:05,946 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 299 [2018-04-11 15:34:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:05,947 INFO L225 Difference]: With dead ends: 317 [2018-04-11 15:34:05,947 INFO L226 Difference]: Without dead ends: 317 [2018-04-11 15:34:05,948 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8781 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4783, Invalid=17269, Unknown=0, NotChecked=0, Total=22052 [2018-04-11 15:34:05,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-04-11 15:34:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 313. [2018-04-11 15:34:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-04-11 15:34:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-04-11 15:34:05,950 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 299 [2018-04-11 15:34:05,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:05,951 INFO L459 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-04-11 15:34:05,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-04-11 15:34:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-04-11 15:34:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-04-11 15:34:05,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:05,952 INFO L355 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 1, 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 15:34:05,952 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash 929932278, now seen corresponding path program 29 times [2018-04-11 15:34:05,952 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:05,952 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:05,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:05,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:05,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:05,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-04-11 15:34:06,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:06,494 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:06,495 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:34:06,550 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-04-11 15:34:06,550 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:06,555 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-04-11 15:34:06,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:06,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38] total 41 [2018-04-11 15:34:06,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 15:34:06,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 15:34:06,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=745, Invalid=895, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:34:06,680 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 41 states. [2018-04-11 15:34:07,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:07,228 INFO L93 Difference]: Finished difference Result 325 states and 326 transitions. [2018-04-11 15:34:07,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 15:34:07,228 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 307 [2018-04-11 15:34:07,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:07,229 INFO L225 Difference]: With dead ends: 325 [2018-04-11 15:34:07,229 INFO L226 Difference]: Without dead ends: 325 [2018-04-11 15:34:07,229 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2150, Invalid=3702, Unknown=0, NotChecked=0, Total=5852 [2018-04-11 15:34:07,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-04-11 15:34:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 321. [2018-04-11 15:34:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-04-11 15:34:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 322 transitions. [2018-04-11 15:34:07,232 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 322 transitions. Word has length 307 [2018-04-11 15:34:07,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:07,232 INFO L459 AbstractCegarLoop]: Abstraction has 321 states and 322 transitions. [2018-04-11 15:34:07,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 15:34:07,232 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 322 transitions. [2018-04-11 15:34:07,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-04-11 15:34:07,233 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:07,233 INFO L355 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 1, 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 15:34:07,233 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:07,233 INFO L82 PathProgramCache]: Analyzing trace with hash -513089322, now seen corresponding path program 30 times [2018-04-11 15:34:07,233 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:07,233 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:07,234 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:07,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:07,234 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:07,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2018-04-11 15:34:07,773 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:07,774 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:07,774 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:34:07,821 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-04-11 15:34:07,821 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:07,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:08,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2018-04-11 15:34:08,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:08,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40] total 78 [2018-04-11 15:34:08,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-11 15:34:08,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-11 15:34:08,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2224, Invalid=3782, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 15:34:08,354 INFO L87 Difference]: Start difference. First operand 321 states and 322 transitions. Second operand 78 states. [2018-04-11 15:34:08,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:08,666 INFO L93 Difference]: Finished difference Result 333 states and 334 transitions. [2018-04-11 15:34:08,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 15:34:08,666 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 315 [2018-04-11 15:34:08,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:08,667 INFO L225 Difference]: With dead ends: 333 [2018-04-11 15:34:08,668 INFO L226 Difference]: Without dead ends: 333 [2018-04-11 15:34:08,668 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2698 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2301, Invalid=3861, Unknown=0, NotChecked=0, Total=6162 [2018-04-11 15:34:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-11 15:34:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2018-04-11 15:34:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-04-11 15:34:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-04-11 15:34:08,671 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 315 [2018-04-11 15:34:08,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:08,671 INFO L459 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-04-11 15:34:08,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-11 15:34:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-04-11 15:34:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-04-11 15:34:08,672 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:08,672 INFO L355 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 1, 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 15:34:08,672 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:08,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1685235382, now seen corresponding path program 31 times [2018-04-11 15:34:08,672 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:08,673 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:08,673 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:08,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:08,673 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:08,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2018-04-11 15:34:09,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:09,245 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:09,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:34:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:09,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2018-04-11 15:34:09,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:09,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 80 [2018-04-11 15:34:09,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-11 15:34:09,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-11 15:34:09,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2341, Invalid=3979, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 15:34:09,929 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 80 states. [2018-04-11 15:34:10,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:10,292 INFO L93 Difference]: Finished difference Result 341 states and 342 transitions. [2018-04-11 15:34:10,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-11 15:34:10,292 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 323 [2018-04-11 15:34:10,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:10,293 INFO L225 Difference]: With dead ends: 341 [2018-04-11 15:34:10,293 INFO L226 Difference]: Without dead ends: 341 [2018-04-11 15:34:10,293 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2847 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2420, Invalid=4060, Unknown=0, NotChecked=0, Total=6480 [2018-04-11 15:34:10,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-04-11 15:34:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 337. [2018-04-11 15:34:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-04-11 15:34:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-04-11 15:34:10,298 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 323 [2018-04-11 15:34:10,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:10,298 INFO L459 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-04-11 15:34:10,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-11 15:34:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-04-11 15:34:10,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-04-11 15:34:10,300 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:10,300 INFO L355 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 1, 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 15:34:10,300 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:10,300 INFO L82 PathProgramCache]: Analyzing trace with hash -485526122, now seen corresponding path program 32 times [2018-04-11 15:34:10,300 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:10,300 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:10,301 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:10,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:34:10,301 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:10,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:10,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2018-04-11 15:34:10,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:10,970 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:10,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:34:10,999 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:34:10,999 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:11,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2018-04-11 15:34:11,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:11,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 41] total 44 [2018-04-11 15:34:11,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 15:34:11,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 15:34:11,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=1027, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:34:11,059 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 44 states. [2018-04-11 15:34:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:11,739 INFO L93 Difference]: Finished difference Result 349 states and 350 transitions. [2018-04-11 15:34:11,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-11 15:34:11,740 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 331 [2018-04-11 15:34:11,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:11,741 INFO L225 Difference]: With dead ends: 349 [2018-04-11 15:34:11,741 INFO L226 Difference]: Without dead ends: 349 [2018-04-11 15:34:11,741 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2504, Invalid=4302, Unknown=0, NotChecked=0, Total=6806 [2018-04-11 15:34:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-11 15:34:11,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2018-04-11 15:34:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-04-11 15:34:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 346 transitions. [2018-04-11 15:34:11,743 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 346 transitions. Word has length 331 [2018-04-11 15:34:11,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:11,744 INFO L459 AbstractCegarLoop]: Abstraction has 345 states and 346 transitions. [2018-04-11 15:34:11,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 15:34:11,744 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 346 transitions. [2018-04-11 15:34:11,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-04-11 15:34:11,745 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:11,745 INFO L355 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 39, 39, 39, 1, 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 15:34:11,745 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:11,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1334562166, now seen corresponding path program 33 times [2018-04-11 15:34:11,745 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:11,745 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:11,746 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:11,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:11,746 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:11,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2018-04-11 15:34:12,412 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:12,412 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:12,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:34:12,469 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-04-11 15:34:12,469 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:12,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2018-04-11 15:34:13,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:13,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 84 [2018-04-11 15:34:13,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-11 15:34:13,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-11 15:34:13,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2584, Invalid=4388, Unknown=0, NotChecked=0, Total=6972 [2018-04-11 15:34:13,057 INFO L87 Difference]: Start difference. First operand 345 states and 346 transitions. Second operand 84 states. [2018-04-11 15:34:13,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:13,546 INFO L93 Difference]: Finished difference Result 357 states and 358 transitions. [2018-04-11 15:34:13,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-11 15:34:13,546 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 339 [2018-04-11 15:34:13,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:13,547 INFO L225 Difference]: With dead ends: 357 [2018-04-11 15:34:13,547 INFO L226 Difference]: Without dead ends: 357 [2018-04-11 15:34:13,548 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3157 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2667, Invalid=4473, Unknown=0, NotChecked=0, Total=7140 [2018-04-11 15:34:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-04-11 15:34:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 353. [2018-04-11 15:34:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-04-11 15:34:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 354 transitions. [2018-04-11 15:34:13,553 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 354 transitions. Word has length 339 [2018-04-11 15:34:13,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:13,553 INFO L459 AbstractCegarLoop]: Abstraction has 353 states and 354 transitions. [2018-04-11 15:34:13,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-11 15:34:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 354 transitions. [2018-04-11 15:34:13,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-04-11 15:34:13,556 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:13,556 INFO L355 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 40, 40, 1, 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 15:34:13,556 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:13,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1947062698, now seen corresponding path program 34 times [2018-04-11 15:34:13,556 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:13,556 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:13,558 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:13,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:13,558 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:13,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 3200 trivial. 0 not checked. [2018-04-11 15:34:14,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:14,272 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:14,273 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:34:14,332 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:34:14,333 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:14,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:14,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:34:14,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:34:14,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:34:14,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:34:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3200 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:34:16,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:16,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 86] total 129 [2018-04-11 15:34:16,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-04-11 15:34:16,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-04-11 15:34:16,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3698, Invalid=12814, Unknown=0, NotChecked=0, Total=16512 [2018-04-11 15:34:16,644 INFO L87 Difference]: Start difference. First operand 353 states and 354 transitions. Second operand 129 states. [2018-04-11 15:34:17,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:17,920 INFO L93 Difference]: Finished difference Result 365 states and 366 transitions. [2018-04-11 15:34:17,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-11 15:34:17,920 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 347 [2018-04-11 15:34:17,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:17,921 INFO L225 Difference]: With dead ends: 365 [2018-04-11 15:34:17,921 INFO L226 Difference]: Without dead ends: 365 [2018-04-11 15:34:17,922 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12009 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=6460, Invalid=23296, Unknown=0, NotChecked=0, Total=29756 [2018-04-11 15:34:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-04-11 15:34:17,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 361. [2018-04-11 15:34:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-04-11 15:34:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 362 transitions. [2018-04-11 15:34:17,925 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 362 transitions. Word has length 347 [2018-04-11 15:34:17,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:17,925 INFO L459 AbstractCegarLoop]: Abstraction has 361 states and 362 transitions. [2018-04-11 15:34:17,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-04-11 15:34:17,925 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 362 transitions. [2018-04-11 15:34:17,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-04-11 15:34:17,926 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:17,926 INFO L355 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 41, 41, 41, 1, 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 15:34:17,926 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:17,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1978853322, now seen corresponding path program 35 times [2018-04-11 15:34:17,926 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:17,926 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:17,927 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:17,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:17,927 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:17,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:18,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2018-04-11 15:34:18,798 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:18,798 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:18,799 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:34:18,860 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-04-11 15:34:18,860 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:18,865 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2018-04-11 15:34:18,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:18,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44] total 47 [2018-04-11 15:34:18,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-11 15:34:18,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-11 15:34:18,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=1168, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 15:34:18,911 INFO L87 Difference]: Start difference. First operand 361 states and 362 transitions. Second operand 47 states. [2018-04-11 15:34:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:19,614 INFO L93 Difference]: Finished difference Result 373 states and 374 transitions. [2018-04-11 15:34:19,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 15:34:19,614 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 355 [2018-04-11 15:34:19,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:19,615 INFO L225 Difference]: With dead ends: 373 [2018-04-11 15:34:19,615 INFO L226 Difference]: Without dead ends: 373 [2018-04-11 15:34:19,616 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2885, Invalid=4947, Unknown=0, NotChecked=0, Total=7832 [2018-04-11 15:34:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-04-11 15:34:19,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 369. [2018-04-11 15:34:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-04-11 15:34:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2018-04-11 15:34:19,618 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 355 [2018-04-11 15:34:19,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:19,618 INFO L459 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2018-04-11 15:34:19,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-11 15:34:19,619 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2018-04-11 15:34:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-04-11 15:34:19,619 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:19,620 INFO L355 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 42, 42, 42, 1, 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 15:34:19,620 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:19,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1801915158, now seen corresponding path program 36 times [2018-04-11 15:34:19,620 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:19,620 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:19,620 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:19,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:19,621 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:19,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2018-04-11 15:34:20,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:20,437 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:20,437 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:34:20,494 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-04-11 15:34:20,495 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:20,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2018-04-11 15:34:21,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:21,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46] total 90 [2018-04-11 15:34:21,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-11 15:34:21,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-11 15:34:21,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2971, Invalid=5039, Unknown=0, NotChecked=0, Total=8010 [2018-04-11 15:34:21,107 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 90 states. [2018-04-11 15:34:21,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:21,548 INFO L93 Difference]: Finished difference Result 381 states and 382 transitions. [2018-04-11 15:34:21,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-11 15:34:21,548 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 363 [2018-04-11 15:34:21,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:21,549 INFO L225 Difference]: With dead ends: 381 [2018-04-11 15:34:21,549 INFO L226 Difference]: Without dead ends: 381 [2018-04-11 15:34:21,550 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3652 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3060, Invalid=5130, Unknown=0, NotChecked=0, Total=8190 [2018-04-11 15:34:21,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-04-11 15:34:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2018-04-11 15:34:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-04-11 15:34:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 378 transitions. [2018-04-11 15:34:21,552 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 378 transitions. Word has length 363 [2018-04-11 15:34:21,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:21,552 INFO L459 AbstractCegarLoop]: Abstraction has 377 states and 378 transitions. [2018-04-11 15:34:21,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-11 15:34:21,552 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 378 transitions. [2018-04-11 15:34:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-04-11 15:34:21,554 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:21,554 INFO L355 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 43, 43, 43, 1, 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 15:34:21,554 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:21,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1588951306, now seen corresponding path program 37 times [2018-04-11 15:34:21,555 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:21,555 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:21,555 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:21,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:21,555 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:21,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2018-04-11 15:34:22,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:22,468 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:22,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:34:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:22,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:23,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2018-04-11 15:34:23,102 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:23,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47] total 92 [2018-04-11 15:34:23,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-11 15:34:23,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-11 15:34:23,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3106, Invalid=5266, Unknown=0, NotChecked=0, Total=8372 [2018-04-11 15:34:23,104 INFO L87 Difference]: Start difference. First operand 377 states and 378 transitions. Second operand 92 states. [2018-04-11 15:34:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:23,494 INFO L93 Difference]: Finished difference Result 389 states and 390 transitions. [2018-04-11 15:34:23,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-11 15:34:23,494 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 371 [2018-04-11 15:34:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:23,495 INFO L225 Difference]: With dead ends: 389 [2018-04-11 15:34:23,495 INFO L226 Difference]: Without dead ends: 389 [2018-04-11 15:34:23,496 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3825 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3197, Invalid=5359, Unknown=0, NotChecked=0, Total=8556 [2018-04-11 15:34:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-04-11 15:34:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2018-04-11 15:34:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-11 15:34:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-04-11 15:34:23,498 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 371 [2018-04-11 15:34:23,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:23,498 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-04-11 15:34:23,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-11 15:34:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-04-11 15:34:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-04-11 15:34:23,499 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:23,499 INFO L355 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 44, 44, 44, 1, 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 15:34:23,499 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:23,500 INFO L82 PathProgramCache]: Analyzing trace with hash 214043606, now seen corresponding path program 38 times [2018-04-11 15:34:23,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:23,500 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:23,500 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:23,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:34:23,500 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:23,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2018-04-11 15:34:24,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:24,343 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:24,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:34:24,374 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:34:24,374 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:24,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2018-04-11 15:34:24,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:24,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 47] total 50 [2018-04-11 15:34:24,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-11 15:34:24,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-11 15:34:24,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=1318, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 15:34:24,465 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 50 states. [2018-04-11 15:34:25,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:25,249 INFO L93 Difference]: Finished difference Result 397 states and 398 transitions. [2018-04-11 15:34:25,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-11 15:34:25,249 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 379 [2018-04-11 15:34:25,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:25,250 INFO L225 Difference]: With dead ends: 397 [2018-04-11 15:34:25,250 INFO L226 Difference]: Without dead ends: 397 [2018-04-11 15:34:25,250 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3293, Invalid=5637, Unknown=0, NotChecked=0, Total=8930 [2018-04-11 15:34:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-04-11 15:34:25,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 393. [2018-04-11 15:34:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-04-11 15:34:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 394 transitions. [2018-04-11 15:34:25,252 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 394 transitions. Word has length 379 [2018-04-11 15:34:25,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:25,252 INFO L459 AbstractCegarLoop]: Abstraction has 393 states and 394 transitions. [2018-04-11 15:34:25,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-11 15:34:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 394 transitions. [2018-04-11 15:34:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-04-11 15:34:25,253 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:25,253 INFO L355 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 45, 45, 45, 1, 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 15:34:25,253 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:25,254 INFO L82 PathProgramCache]: Analyzing trace with hash 513284534, now seen corresponding path program 39 times [2018-04-11 15:34:25,254 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:25,254 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:25,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:25,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:25,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:25,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2018-04-11 15:34:26,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:26,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:26,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:34:26,164 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-04-11 15:34:26,164 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:26,176 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2018-04-11 15:34:26,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:26,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 48] total 51 [2018-04-11 15:34:26,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-11 15:34:26,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-11 15:34:26,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1180, Invalid=1370, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 15:34:26,229 INFO L87 Difference]: Start difference. First operand 393 states and 394 transitions. Second operand 51 states. [2018-04-11 15:34:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:27,031 INFO L93 Difference]: Finished difference Result 405 states and 406 transitions. [2018-04-11 15:34:27,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 15:34:27,032 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 387 [2018-04-11 15:34:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:27,032 INFO L225 Difference]: With dead ends: 405 [2018-04-11 15:34:27,033 INFO L226 Difference]: Without dead ends: 405 [2018-04-11 15:34:27,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3435, Invalid=5877, Unknown=0, NotChecked=0, Total=9312 [2018-04-11 15:34:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-04-11 15:34:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 401. [2018-04-11 15:34:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-11 15:34:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 402 transitions. [2018-04-11 15:34:27,035 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 402 transitions. Word has length 387 [2018-04-11 15:34:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:27,036 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 402 transitions. [2018-04-11 15:34:27,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-11 15:34:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 402 transitions. [2018-04-11 15:34:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-04-11 15:34:27,037 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:27,038 INFO L355 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 1, 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 15:34:27,038 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:27,038 INFO L82 PathProgramCache]: Analyzing trace with hash -145280874, now seen corresponding path program 40 times [2018-04-11 15:34:27,038 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:27,038 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:27,039 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:27,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:27,039 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:27,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2018-04-11 15:34:27,927 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:27,927 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:27,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:34:28,003 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:34:28,004 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:28,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:28,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:34:28,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:34:28,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:34:28,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:34:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4232 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:34:30,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:30,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 98] total 147 [2018-04-11 15:34:30,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-04-11 15:34:30,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-04-11 15:34:30,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4802, Invalid=16660, Unknown=0, NotChecked=0, Total=21462 [2018-04-11 15:34:30,886 INFO L87 Difference]: Start difference. First operand 401 states and 402 transitions. Second operand 147 states. [2018-04-11 15:34:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:32,497 INFO L93 Difference]: Finished difference Result 413 states and 414 transitions. [2018-04-11 15:34:32,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-11 15:34:32,497 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 395 [2018-04-11 15:34:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:32,498 INFO L225 Difference]: With dead ends: 413 [2018-04-11 15:34:32,498 INFO L226 Difference]: Without dead ends: 413 [2018-04-11 15:34:32,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15741 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8389, Invalid=30223, Unknown=0, NotChecked=0, Total=38612 [2018-04-11 15:34:32,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-11 15:34:32,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 409. [2018-04-11 15:34:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-04-11 15:34:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 410 transitions. [2018-04-11 15:34:32,501 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 410 transitions. Word has length 395 [2018-04-11 15:34:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:32,501 INFO L459 AbstractCegarLoop]: Abstraction has 409 states and 410 transitions. [2018-04-11 15:34:32,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-04-11 15:34:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 410 transitions. [2018-04-11 15:34:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-04-11 15:34:32,502 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:32,503 INFO L355 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 47, 47, 47, 1, 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 15:34:32,503 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:32,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2025205642, now seen corresponding path program 41 times [2018-04-11 15:34:32,503 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:32,503 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:32,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:32,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:32,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:32,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:33,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-04-11 15:34:33,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:33,450 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:33,450 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:34:33,536 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-04-11 15:34:33,536 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:33,542 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:33,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-04-11 15:34:33,605 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:33,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 50] total 53 [2018-04-11 15:34:33,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-11 15:34:33,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-11 15:34:33,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=1477, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 15:34:33,606 INFO L87 Difference]: Start difference. First operand 409 states and 410 transitions. Second operand 53 states. [2018-04-11 15:34:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:34,439 INFO L93 Difference]: Finished difference Result 421 states and 422 transitions. [2018-04-11 15:34:34,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-11 15:34:34,439 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 403 [2018-04-11 15:34:34,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:34,440 INFO L225 Difference]: With dead ends: 421 [2018-04-11 15:34:34,440 INFO L226 Difference]: Without dead ends: 421 [2018-04-11 15:34:34,441 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3728, Invalid=6372, Unknown=0, NotChecked=0, Total=10100 [2018-04-11 15:34:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-04-11 15:34:34,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 417. [2018-04-11 15:34:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-04-11 15:34:34,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2018-04-11 15:34:34,445 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 403 [2018-04-11 15:34:34,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:34,446 INFO L459 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2018-04-11 15:34:34,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-11 15:34:34,446 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2018-04-11 15:34:34,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-04-11 15:34:34,448 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:34,448 INFO L355 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 48, 48, 48, 1, 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 15:34:34,448 INFO L408 AbstractCegarLoop]: === Iteration 54 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:34,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1367705258, now seen corresponding path program 42 times [2018-04-11 15:34:34,448 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:34,448 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:34,449 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:34,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:34,449 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:34,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2018-04-11 15:34:35,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:35,418 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:35,418 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:34:35,548 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-04-11 15:34:35,548 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:35,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2018-04-11 15:34:36,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:36,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52] total 102 [2018-04-11 15:34:36,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-04-11 15:34:36,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-04-11 15:34:36,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3826, Invalid=6476, Unknown=0, NotChecked=0, Total=10302 [2018-04-11 15:34:36,301 INFO L87 Difference]: Start difference. First operand 417 states and 418 transitions. Second operand 102 states. [2018-04-11 15:34:36,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:36,789 INFO L93 Difference]: Finished difference Result 429 states and 430 transitions. [2018-04-11 15:34:36,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-11 15:34:36,789 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 411 [2018-04-11 15:34:36,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:36,790 INFO L225 Difference]: With dead ends: 429 [2018-04-11 15:34:36,790 INFO L226 Difference]: Without dead ends: 429 [2018-04-11 15:34:36,791 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 362 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4750 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3927, Invalid=6579, Unknown=0, NotChecked=0, Total=10506 [2018-04-11 15:34:36,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-04-11 15:34:36,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 425. [2018-04-11 15:34:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-04-11 15:34:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 426 transitions. [2018-04-11 15:34:36,793 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 426 transitions. Word has length 411 [2018-04-11 15:34:36,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:36,794 INFO L459 AbstractCegarLoop]: Abstraction has 425 states and 426 transitions. [2018-04-11 15:34:36,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-04-11 15:34:36,794 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 426 transitions. [2018-04-11 15:34:36,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-04-11 15:34:36,795 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:36,795 INFO L355 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 49, 49, 49, 1, 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 15:34:36,795 INFO L408 AbstractCegarLoop]: === Iteration 55 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:36,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1555278646, now seen corresponding path program 43 times [2018-04-11 15:34:36,795 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:36,795 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:36,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:36,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:36,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:36,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2018-04-11 15:34:37,835 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:37,835 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:37,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:34:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:37,868 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2018-04-11 15:34:38,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:38,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53] total 104 [2018-04-11 15:34:38,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-04-11 15:34:38,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-04-11 15:34:38,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3979, Invalid=6733, Unknown=0, NotChecked=0, Total=10712 [2018-04-11 15:34:38,665 INFO L87 Difference]: Start difference. First operand 425 states and 426 transitions. Second operand 104 states. [2018-04-11 15:34:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:39,226 INFO L93 Difference]: Finished difference Result 437 states and 438 transitions. [2018-04-11 15:34:39,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-11 15:34:39,227 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 419 [2018-04-11 15:34:39,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:39,227 INFO L225 Difference]: With dead ends: 437 [2018-04-11 15:34:39,228 INFO L226 Difference]: Without dead ends: 437 [2018-04-11 15:34:39,228 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 369 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4947 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=4082, Invalid=6838, Unknown=0, NotChecked=0, Total=10920 [2018-04-11 15:34:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-04-11 15:34:39,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2018-04-11 15:34:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-11 15:34:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 434 transitions. [2018-04-11 15:34:39,230 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 434 transitions. Word has length 419 [2018-04-11 15:34:39,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:39,230 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 434 transitions. [2018-04-11 15:34:39,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-04-11 15:34:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 434 transitions. [2018-04-11 15:34:39,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-04-11 15:34:39,231 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:39,232 INFO L355 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 1, 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 15:34:39,232 INFO L408 AbstractCegarLoop]: === Iteration 56 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:39,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1317018090, now seen corresponding path program 44 times [2018-04-11 15:34:39,232 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:39,232 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:39,232 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:39,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:34:39,232 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:39,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2018-04-11 15:34:40,400 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:40,401 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:40,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:34:40,440 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:34:40,441 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:40,447 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2018-04-11 15:34:40,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:40,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 53] total 56 [2018-04-11 15:34:40,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-11 15:34:40,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-11 15:34:40,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1435, Invalid=1645, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 15:34:40,511 INFO L87 Difference]: Start difference. First operand 433 states and 434 transitions. Second operand 56 states. [2018-04-11 15:34:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:41,495 INFO L93 Difference]: Finished difference Result 445 states and 446 transitions. [2018-04-11 15:34:41,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-11 15:34:41,495 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 427 [2018-04-11 15:34:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:41,496 INFO L225 Difference]: With dead ends: 445 [2018-04-11 15:34:41,496 INFO L226 Difference]: Without dead ends: 445 [2018-04-11 15:34:41,496 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4190, Invalid=7152, Unknown=0, NotChecked=0, Total=11342 [2018-04-11 15:34:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-04-11 15:34:41,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 441. [2018-04-11 15:34:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-04-11 15:34:41,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 442 transitions. [2018-04-11 15:34:41,498 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 442 transitions. Word has length 427 [2018-04-11 15:34:41,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:41,499 INFO L459 AbstractCegarLoop]: Abstraction has 441 states and 442 transitions. [2018-04-11 15:34:41,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-11 15:34:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 442 transitions. [2018-04-11 15:34:41,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-04-11 15:34:41,500 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:41,500 INFO L355 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 51, 51, 51, 1, 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 15:34:41,500 INFO L408 AbstractCegarLoop]: === Iteration 57 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:41,500 INFO L82 PathProgramCache]: Analyzing trace with hash 472492534, now seen corresponding path program 45 times [2018-04-11 15:34:41,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:41,500 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:41,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:41,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:41,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:41,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2018-04-11 15:34:42,596 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:42,596 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:42,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:34:42,683 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-04-11 15:34:42,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:42,715 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2018-04-11 15:34:43,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:43,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 108 [2018-04-11 15:34:43,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-04-11 15:34:43,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-04-11 15:34:43,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4294, Invalid=7262, Unknown=0, NotChecked=0, Total=11556 [2018-04-11 15:34:43,550 INFO L87 Difference]: Start difference. First operand 441 states and 442 transitions. Second operand 108 states. [2018-04-11 15:34:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:44,153 INFO L93 Difference]: Finished difference Result 453 states and 454 transitions. [2018-04-11 15:34:44,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-11 15:34:44,153 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 435 [2018-04-11 15:34:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:44,154 INFO L225 Difference]: With dead ends: 453 [2018-04-11 15:34:44,154 INFO L226 Difference]: Without dead ends: 453 [2018-04-11 15:34:44,155 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 383 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5353 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=4401, Invalid=7371, Unknown=0, NotChecked=0, Total=11772 [2018-04-11 15:34:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-04-11 15:34:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2018-04-11 15:34:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-04-11 15:34:44,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 450 transitions. [2018-04-11 15:34:44,157 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 450 transitions. Word has length 435 [2018-04-11 15:34:44,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:44,157 INFO L459 AbstractCegarLoop]: Abstraction has 449 states and 450 transitions. [2018-04-11 15:34:44,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-04-11 15:34:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 450 transitions. [2018-04-11 15:34:44,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-04-11 15:34:44,159 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:44,159 INFO L355 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 52, 52, 52, 1, 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 15:34:44,159 INFO L408 AbstractCegarLoop]: === Iteration 58 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:44,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2075883222, now seen corresponding path program 46 times [2018-04-11 15:34:44,159 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:44,159 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:44,159 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:44,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:44,159 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:44,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 5408 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2018-04-11 15:34:45,289 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:45,289 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:45,289 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:34:45,387 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:34:45,387 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:45,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:45,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:34:45,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:34:45,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:34:45,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:34:48,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 5408 proven. 5408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:34:48,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:48,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 110] total 165 [2018-04-11 15:34:48,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-04-11 15:34:48,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-04-11 15:34:48,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6050, Invalid=21010, Unknown=0, NotChecked=0, Total=27060 [2018-04-11 15:34:48,977 INFO L87 Difference]: Start difference. First operand 449 states and 450 transitions. Second operand 165 states. [2018-04-11 15:34:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:50,827 INFO L93 Difference]: Finished difference Result 461 states and 462 transitions. [2018-04-11 15:34:50,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-11 15:34:50,827 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 443 [2018-04-11 15:34:50,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:50,828 INFO L225 Difference]: With dead ends: 461 [2018-04-11 15:34:50,828 INFO L226 Difference]: Without dead ends: 461 [2018-04-11 15:34:50,830 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19977 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=10570, Invalid=38050, Unknown=0, NotChecked=0, Total=48620 [2018-04-11 15:34:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-04-11 15:34:50,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 457. [2018-04-11 15:34:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-04-11 15:34:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 458 transitions. [2018-04-11 15:34:50,832 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 458 transitions. Word has length 443 [2018-04-11 15:34:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:50,832 INFO L459 AbstractCegarLoop]: Abstraction has 457 states and 458 transitions. [2018-04-11 15:34:50,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-04-11 15:34:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 458 transitions. [2018-04-11 15:34:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-04-11 15:34:50,833 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:50,834 INFO L355 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 53, 53, 53, 1, 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 15:34:50,834 INFO L408 AbstractCegarLoop]: === Iteration 59 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1056951478, now seen corresponding path program 47 times [2018-04-11 15:34:50,834 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:50,834 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:50,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:50,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:50,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:50,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2018-04-11 15:34:52,031 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:52,031 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:52,031 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:34:52,147 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-04-11 15:34:52,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:52,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2018-04-11 15:34:52,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:52,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 56] total 59 [2018-04-11 15:34:52,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-11 15:34:52,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-11 15:34:52,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1600, Invalid=1822, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:34:52,270 INFO L87 Difference]: Start difference. First operand 457 states and 458 transitions. Second operand 59 states. [2018-04-11 15:34:53,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:53,291 INFO L93 Difference]: Finished difference Result 469 states and 470 transitions. [2018-04-11 15:34:53,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-11 15:34:53,292 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 451 [2018-04-11 15:34:53,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:53,292 INFO L225 Difference]: With dead ends: 469 [2018-04-11 15:34:53,293 INFO L226 Difference]: Without dead ends: 469 [2018-04-11 15:34:53,293 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4679, Invalid=7977, Unknown=0, NotChecked=0, Total=12656 [2018-04-11 15:34:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-04-11 15:34:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 465. [2018-04-11 15:34:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-04-11 15:34:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 466 transitions. [2018-04-11 15:34:53,295 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 466 transitions. Word has length 451 [2018-04-11 15:34:53,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:53,296 INFO L459 AbstractCegarLoop]: Abstraction has 465 states and 466 transitions. [2018-04-11 15:34:53,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-11 15:34:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 466 transitions. [2018-04-11 15:34:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-04-11 15:34:53,297 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:53,297 INFO L355 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 54, 54, 54, 1, 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 15:34:53,297 INFO L408 AbstractCegarLoop]: === Iteration 60 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:53,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2071909482, now seen corresponding path program 48 times [2018-04-11 15:34:53,297 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:53,298 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:53,298 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:53,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:53,298 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:53,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2018-04-11 15:34:54,514 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:54,514 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:54,514 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:34:54,639 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-04-11 15:34:54,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:34:54,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2018-04-11 15:34:55,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:55,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58] total 114 [2018-04-11 15:34:55,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-04-11 15:34:55,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-04-11 15:34:55,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4789, Invalid=8093, Unknown=0, NotChecked=0, Total=12882 [2018-04-11 15:34:55,672 INFO L87 Difference]: Start difference. First operand 465 states and 466 transitions. Second operand 114 states. [2018-04-11 15:34:56,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:56,307 INFO L93 Difference]: Finished difference Result 477 states and 478 transitions. [2018-04-11 15:34:56,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-11 15:34:56,308 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 459 [2018-04-11 15:34:56,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:56,309 INFO L225 Difference]: With dead ends: 477 [2018-04-11 15:34:56,309 INFO L226 Difference]: Without dead ends: 477 [2018-04-11 15:34:56,310 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 404 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5992 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4902, Invalid=8208, Unknown=0, NotChecked=0, Total=13110 [2018-04-11 15:34:56,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-04-11 15:34:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 473. [2018-04-11 15:34:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-04-11 15:34:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 474 transitions. [2018-04-11 15:34:56,312 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 474 transitions. Word has length 459 [2018-04-11 15:34:56,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:56,313 INFO L459 AbstractCegarLoop]: Abstraction has 473 states and 474 transitions. [2018-04-11 15:34:56,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-04-11 15:34:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 474 transitions. [2018-04-11 15:34:56,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-04-11 15:34:56,314 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:56,314 INFO L355 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 55, 55, 55, 1, 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 15:34:56,314 INFO L408 AbstractCegarLoop]: === Iteration 61 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:56,314 INFO L82 PathProgramCache]: Analyzing trace with hash 982127478, now seen corresponding path program 49 times [2018-04-11 15:34:56,314 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:56,314 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:56,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:56,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:34:56,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:56,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:34:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2018-04-11 15:34:57,611 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:34:57,611 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:34:57,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:34:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:57,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:34:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2018-04-11 15:34:58,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:34:58,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59] total 116 [2018-04-11 15:34:58,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-04-11 15:34:58,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-04-11 15:34:58,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4960, Invalid=8380, Unknown=0, NotChecked=0, Total=13340 [2018-04-11 15:34:58,600 INFO L87 Difference]: Start difference. First operand 473 states and 474 transitions. Second operand 116 states. [2018-04-11 15:34:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:34:59,142 INFO L93 Difference]: Finished difference Result 485 states and 486 transitions. [2018-04-11 15:34:59,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-11 15:34:59,143 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 467 [2018-04-11 15:34:59,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:34:59,144 INFO L225 Difference]: With dead ends: 485 [2018-04-11 15:34:59,144 INFO L226 Difference]: Without dead ends: 485 [2018-04-11 15:34:59,144 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6213 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=5075, Invalid=8497, Unknown=0, NotChecked=0, Total=13572 [2018-04-11 15:34:59,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-04-11 15:34:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 481. [2018-04-11 15:34:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-04-11 15:34:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 482 transitions. [2018-04-11 15:34:59,147 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 482 transitions. Word has length 467 [2018-04-11 15:34:59,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:34:59,147 INFO L459 AbstractCegarLoop]: Abstraction has 481 states and 482 transitions. [2018-04-11 15:34:59,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-04-11 15:34:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 482 transitions. [2018-04-11 15:34:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2018-04-11 15:34:59,148 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:34:59,148 INFO L355 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 56, 56, 56, 1, 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 15:34:59,148 INFO L408 AbstractCegarLoop]: === Iteration 62 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:34:59,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1059390550, now seen corresponding path program 50 times [2018-04-11 15:34:59,149 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:34:59,149 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:34:59,149 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:59,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:34:59,149 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:34:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:34:59,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:35:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2018-04-11 15:35:00,458 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:35:00,458 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:35:00,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:35:00,506 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:35:00,506 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:35:00,514 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:35:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2018-04-11 15:35:00,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:35:00,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 59] total 62 [2018-04-11 15:35:00,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-11 15:35:00,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-11 15:35:00,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1774, Invalid=2008, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 15:35:00,590 INFO L87 Difference]: Start difference. First operand 481 states and 482 transitions. Second operand 62 states. [2018-04-11 15:35:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:35:01,999 INFO L93 Difference]: Finished difference Result 493 states and 494 transitions. [2018-04-11 15:35:02,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-11 15:35:02,000 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 475 [2018-04-11 15:35:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:35:02,001 INFO L225 Difference]: With dead ends: 493 [2018-04-11 15:35:02,001 INFO L226 Difference]: Without dead ends: 493 [2018-04-11 15:35:02,001 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5195, Invalid=8847, Unknown=0, NotChecked=0, Total=14042 [2018-04-11 15:35:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-04-11 15:35:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 489. [2018-04-11 15:35:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-04-11 15:35:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 490 transitions. [2018-04-11 15:35:02,004 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 490 transitions. Word has length 475 [2018-04-11 15:35:02,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:35:02,004 INFO L459 AbstractCegarLoop]: Abstraction has 489 states and 490 transitions. [2018-04-11 15:35:02,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-11 15:35:02,004 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 490 transitions. [2018-04-11 15:35:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-04-11 15:35:02,006 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:35:02,006 INFO L355 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 57, 57, 57, 1, 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 15:35:02,006 INFO L408 AbstractCegarLoop]: === Iteration 63 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:35:02,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2145616330, now seen corresponding path program 51 times [2018-04-11 15:35:02,006 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:35:02,006 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:35:02,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:02,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:35:02,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:35:02,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:35:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2018-04-11 15:35:03,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:35:03,387 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:35:03,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:35:03,487 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-04-11 15:35:03,487 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:35:03,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:35:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2018-04-11 15:35:03,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:35:03,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 60] total 63 [2018-04-11 15:35:03,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-11 15:35:03,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-11 15:35:03,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2018-04-11 15:35:03,621 INFO L87 Difference]: Start difference. First operand 489 states and 490 transitions. Second operand 63 states. [2018-04-11 15:35:04,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:35:04,759 INFO L93 Difference]: Finished difference Result 501 states and 502 transitions. [2018-04-11 15:35:04,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-11 15:35:04,759 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 483 [2018-04-11 15:35:04,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:35:04,760 INFO L225 Difference]: With dead ends: 501 [2018-04-11 15:35:04,761 INFO L226 Difference]: Without dead ends: 501 [2018-04-11 15:35:04,761 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1878 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=5373, Invalid=9147, Unknown=0, NotChecked=0, Total=14520 [2018-04-11 15:35:04,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-04-11 15:35:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 497. [2018-04-11 15:35:04,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-04-11 15:35:04,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 498 transitions. [2018-04-11 15:35:04,765 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 498 transitions. Word has length 483 [2018-04-11 15:35:04,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:35:04,765 INFO L459 AbstractCegarLoop]: Abstraction has 497 states and 498 transitions. [2018-04-11 15:35:04,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-11 15:35:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 498 transitions. [2018-04-11 15:35:04,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2018-04-11 15:35:04,766 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:35:04,766 INFO L355 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 58, 58, 58, 1, 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 15:35:04,766 INFO L408 AbstractCegarLoop]: === Iteration 64 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:35:04,766 INFO L82 PathProgramCache]: Analyzing trace with hash 452657430, now seen corresponding path program 52 times [2018-04-11 15:35:04,766 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:35:04,767 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:35:04,767 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:04,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:35:04,767 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:35:04,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:35:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 6728 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked. [2018-04-11 15:35:06,191 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:35:06,191 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:35:06,191 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:35:06,304 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:35:06,305 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:35:06,324 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:35:06,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:35:06,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:35:06,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:35:06,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:35:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 6728 proven. 6728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:35:10,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:35:10,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 122] total 183 [2018-04-11 15:35:10,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-04-11 15:35:10,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-04-11 15:35:10,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7442, Invalid=25864, Unknown=0, NotChecked=0, Total=33306 [2018-04-11 15:35:10,667 INFO L87 Difference]: Start difference. First operand 497 states and 498 transitions. Second operand 183 states. [2018-04-11 15:35:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:35:12,971 INFO L93 Difference]: Finished difference Result 509 states and 510 transitions. [2018-04-11 15:35:12,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-11 15:35:12,971 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 491 [2018-04-11 15:35:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:35:12,972 INFO L225 Difference]: With dead ends: 509 [2018-04-11 15:35:12,972 INFO L226 Difference]: Without dead ends: 509 [2018-04-11 15:35:12,974 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24717 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=13003, Invalid=46777, Unknown=0, NotChecked=0, Total=59780 [2018-04-11 15:35:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-04-11 15:35:12,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 505. [2018-04-11 15:35:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-04-11 15:35:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 506 transitions. [2018-04-11 15:35:12,978 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 506 transitions. Word has length 491 [2018-04-11 15:35:12,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:35:12,979 INFO L459 AbstractCegarLoop]: Abstraction has 505 states and 506 transitions. [2018-04-11 15:35:12,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-04-11 15:35:12,979 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 506 transitions. [2018-04-11 15:35:12,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-04-11 15:35:12,980 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:35:12,981 INFO L355 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 59, 59, 59, 1, 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 15:35:12,981 INFO L408 AbstractCegarLoop]: === Iteration 65 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:35:12,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2097876214, now seen corresponding path program 53 times [2018-04-11 15:35:12,981 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:35:12,981 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:35:12,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:12,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:35:12,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:35:13,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:35:14,464 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2018-04-11 15:35:14,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:35:14,465 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:35:14,465 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:35:14,591 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-04-11 15:35:14,591 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:35:14,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:35:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2018-04-11 15:35:14,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:35:14,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 62] total 65 [2018-04-11 15:35:14,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-11 15:35:14,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-11 15:35:14,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 15:35:14,681 INFO L87 Difference]: Start difference. First operand 505 states and 506 transitions. Second operand 65 states. [2018-04-11 15:35:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:35:15,892 INFO L93 Difference]: Finished difference Result 517 states and 518 transitions. [2018-04-11 15:35:15,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-11 15:35:15,892 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 499 [2018-04-11 15:35:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:35:15,893 INFO L225 Difference]: With dead ends: 517 [2018-04-11 15:35:15,893 INFO L226 Difference]: Without dead ends: 517 [2018-04-11 15:35:15,894 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 559 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2003 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5738, Invalid=9762, Unknown=0, NotChecked=0, Total=15500 [2018-04-11 15:35:15,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-04-11 15:35:15,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 513. [2018-04-11 15:35:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-04-11 15:35:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 514 transitions. [2018-04-11 15:35:15,896 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 514 transitions. Word has length 499 [2018-04-11 15:35:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:35:15,896 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 514 transitions. [2018-04-11 15:35:15,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-11 15:35:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 514 transitions. [2018-04-11 15:35:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-04-11 15:35:15,898 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:35:15,898 INFO L355 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 60, 60, 60, 1, 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 15:35:15,898 INFO L408 AbstractCegarLoop]: === Iteration 66 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:35:15,898 INFO L82 PathProgramCache]: Analyzing trace with hash -2091441706, now seen corresponding path program 54 times [2018-04-11 15:35:15,898 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:35:15,898 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:35:15,899 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:15,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:35:15,899 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:35:15,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:35:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2018-04-11 15:35:17,415 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:35:17,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:35:17,416 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:35:17,515 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-04-11 15:35:17,515 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:35:17,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:35:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2018-04-11 15:35:17,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:35:17,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 63] total 66 [2018-04-11 15:35:17,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-11 15:35:17,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-11 15:35:17,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2020, Invalid=2270, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 15:35:17,621 INFO L87 Difference]: Start difference. First operand 513 states and 514 transitions. Second operand 66 states. [2018-04-11 15:35:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:35:18,801 INFO L93 Difference]: Finished difference Result 525 states and 526 transitions. [2018-04-11 15:35:18,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-11 15:35:18,801 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 507 [2018-04-11 15:35:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:35:18,802 INFO L225 Difference]: With dead ends: 525 [2018-04-11 15:35:18,802 INFO L226 Difference]: Without dead ends: 525 [2018-04-11 15:35:18,803 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5925, Invalid=10077, Unknown=0, NotChecked=0, Total=16002 [2018-04-11 15:35:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-04-11 15:35:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 521. [2018-04-11 15:35:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-04-11 15:35:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 522 transitions. [2018-04-11 15:35:18,805 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 522 transitions. Word has length 507 [2018-04-11 15:35:18,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:35:18,805 INFO L459 AbstractCegarLoop]: Abstraction has 521 states and 522 transitions. [2018-04-11 15:35:18,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-11 15:35:18,806 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 522 transitions. [2018-04-11 15:35:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-04-11 15:35:18,807 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:35:18,807 INFO L355 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 61, 61, 61, 1, 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 15:35:18,807 INFO L408 AbstractCegarLoop]: === Iteration 67 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:35:18,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1700151370, now seen corresponding path program 55 times [2018-04-11 15:35:18,807 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:35:18,808 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:35:18,808 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:18,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:35:18,808 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:35:18,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:35:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 7442 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2018-04-11 15:35:20,413 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:35:20,413 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:35:20,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:35:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:35:20,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:35:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 7442 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2018-04-11 15:35:21,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:35:21,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65] total 128 [2018-04-11 15:35:21,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-04-11 15:35:21,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-04-11 15:35:21,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6049, Invalid=10207, Unknown=0, NotChecked=0, Total=16256 [2018-04-11 15:35:21,633 INFO L87 Difference]: Start difference. First operand 521 states and 522 transitions. Second operand 128 states. [2018-04-11 15:35:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:35:22,378 INFO L93 Difference]: Finished difference Result 533 states and 534 transitions. [2018-04-11 15:35:22,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-11 15:35:22,379 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 515 [2018-04-11 15:35:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:35:22,380 INFO L225 Difference]: With dead ends: 533 [2018-04-11 15:35:22,380 INFO L226 Difference]: Without dead ends: 533 [2018-04-11 15:35:22,380 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 453 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7623 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=6176, Invalid=10336, Unknown=0, NotChecked=0, Total=16512 [2018-04-11 15:35:22,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-04-11 15:35:22,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 529. [2018-04-11 15:35:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-04-11 15:35:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 530 transitions. [2018-04-11 15:35:22,383 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 530 transitions. Word has length 515 [2018-04-11 15:35:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:35:22,383 INFO L459 AbstractCegarLoop]: Abstraction has 529 states and 530 transitions. [2018-04-11 15:35:22,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-04-11 15:35:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 530 transitions. [2018-04-11 15:35:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-04-11 15:35:22,385 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:35:22,385 INFO L355 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 62, 62, 62, 62, 1, 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 15:35:22,385 INFO L408 AbstractCegarLoop]: === Iteration 68 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:35:22,385 INFO L82 PathProgramCache]: Analyzing trace with hash -544381290, now seen corresponding path program 56 times [2018-04-11 15:35:22,385 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:35:22,385 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:35:22,385 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:22,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:35:22,385 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:35:22,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:35:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2018-04-11 15:35:24,067 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:35:24,067 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:35:24,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:35:24,122 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:35:24,123 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:35:24,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:35:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2018-04-11 15:35:24,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:35:24,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 65] total 68 [2018-04-11 15:35:24,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-11 15:35:24,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-11 15:35:24,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2149, Invalid=2407, Unknown=0, NotChecked=0, Total=4556 [2018-04-11 15:35:24,222 INFO L87 Difference]: Start difference. First operand 529 states and 530 transitions. Second operand 68 states. [2018-04-11 15:35:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:35:25,523 INFO L93 Difference]: Finished difference Result 541 states and 542 transitions. [2018-04-11 15:35:25,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-11 15:35:25,523 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 523 [2018-04-11 15:35:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:35:25,524 INFO L225 Difference]: With dead ends: 541 [2018-04-11 15:35:25,525 INFO L226 Difference]: Without dead ends: 541 [2018-04-11 15:35:25,525 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 715 GetRequests, 586 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2198 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=6308, Invalid=10722, Unknown=0, NotChecked=0, Total=17030 [2018-04-11 15:35:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-04-11 15:35:25,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 537. [2018-04-11 15:35:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-04-11 15:35:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 538 transitions. [2018-04-11 15:35:25,528 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 538 transitions. Word has length 523 [2018-04-11 15:35:25,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:35:25,529 INFO L459 AbstractCegarLoop]: Abstraction has 537 states and 538 transitions. [2018-04-11 15:35:25,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-11 15:35:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 538 transitions. [2018-04-11 15:35:25,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-04-11 15:35:25,530 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:35:25,530 INFO L355 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 63, 63, 63, 63, 1, 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 15:35:25,530 INFO L408 AbstractCegarLoop]: === Iteration 69 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:35:25,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1045206646, now seen corresponding path program 57 times [2018-04-11 15:35:25,531 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:35:25,531 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:35:25,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:25,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:35:25,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:35:25,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:35:27,255 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 7938 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2018-04-11 15:35:27,256 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:35:27,256 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:35:27,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:35:27,361 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-04-11 15:35:27,362 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:35:27,384 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:35:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 7938 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2018-04-11 15:35:28,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:35:28,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67] total 132 [2018-04-11 15:35:28,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-04-11 15:35:28,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-04-11 15:35:28,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6436, Invalid=10856, Unknown=0, NotChecked=0, Total=17292 [2018-04-11 15:35:28,586 INFO L87 Difference]: Start difference. First operand 537 states and 538 transitions. Second operand 132 states. [2018-04-11 15:35:29,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:35:29,470 INFO L93 Difference]: Finished difference Result 549 states and 550 transitions. [2018-04-11 15:35:29,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-11 15:35:29,470 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 531 [2018-04-11 15:35:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:35:29,471 INFO L225 Difference]: With dead ends: 549 [2018-04-11 15:35:29,471 INFO L226 Difference]: Without dead ends: 549 [2018-04-11 15:35:29,472 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 467 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8125 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=6567, Invalid=10989, Unknown=0, NotChecked=0, Total=17556 [2018-04-11 15:35:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-04-11 15:35:29,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 545. [2018-04-11 15:35:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-04-11 15:35:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 546 transitions. [2018-04-11 15:35:29,474 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 546 transitions. Word has length 531 [2018-04-11 15:35:29,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:35:29,474 INFO L459 AbstractCegarLoop]: Abstraction has 545 states and 546 transitions. [2018-04-11 15:35:29,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-04-11 15:35:29,474 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 546 transitions. [2018-04-11 15:35:29,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2018-04-11 15:35:29,476 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:35:29,476 INFO L355 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 64, 64, 64, 64, 1, 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 15:35:29,476 INFO L408 AbstractCegarLoop]: === Iteration 70 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:35:29,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1829646506, now seen corresponding path program 58 times [2018-04-11 15:35:29,476 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:35:29,476 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:35:29,477 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:29,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:35:29,477 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:35:29,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:35:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 0 proven. 8192 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2018-04-11 15:35:31,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:35:31,240 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:35:31,240 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:35:31,399 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:35:31,400 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:35:31,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:35:31,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:35:31,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:35:31,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:35:31,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:35:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 8192 proven. 8192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:35:36,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:35:36,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 134] total 201 [2018-04-11 15:35:36,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-04-11 15:35:36,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-04-11 15:35:36,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8978, Invalid=31222, Unknown=0, NotChecked=0, Total=40200 [2018-04-11 15:35:36,610 INFO L87 Difference]: Start difference. First operand 545 states and 546 transitions. Second operand 201 states. [2018-04-11 15:35:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:35:39,414 INFO L93 Difference]: Finished difference Result 557 states and 558 transitions. [2018-04-11 15:35:39,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-11 15:35:39,414 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 539 [2018-04-11 15:35:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:35:39,415 INFO L225 Difference]: With dead ends: 557 [2018-04-11 15:35:39,415 INFO L226 Difference]: Without dead ends: 557 [2018-04-11 15:35:39,417 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29961 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=15688, Invalid=56404, Unknown=0, NotChecked=0, Total=72092 [2018-04-11 15:35:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-04-11 15:35:39,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 553. [2018-04-11 15:35:39,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-04-11 15:35:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 554 transitions. [2018-04-11 15:35:39,421 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 554 transitions. Word has length 539 [2018-04-11 15:35:39,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:35:39,421 INFO L459 AbstractCegarLoop]: Abstraction has 553 states and 554 transitions. [2018-04-11 15:35:39,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-04-11 15:35:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 554 transitions. [2018-04-11 15:35:39,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2018-04-11 15:35:39,423 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:35:39,423 INFO L355 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 65, 65, 65, 65, 1, 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 15:35:39,423 INFO L408 AbstractCegarLoop]: === Iteration 71 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:35:39,423 INFO L82 PathProgramCache]: Analyzing trace with hash -918056650, now seen corresponding path program 59 times [2018-04-11 15:35:39,423 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:35:39,423 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:35:39,423 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:39,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:35:39,423 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:35:39,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:35:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2018-04-11 15:35:41,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:35:41,277 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:35:41,277 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:35:41,447 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-04-11 15:35:41,447 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:35:41,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:35:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2018-04-11 15:35:41,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:35:41,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 68] total 71 [2018-04-11 15:35:41,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-11 15:35:41,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-11 15:35:41,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2350, Invalid=2620, Unknown=0, NotChecked=0, Total=4970 [2018-04-11 15:35:41,566 INFO L87 Difference]: Start difference. First operand 553 states and 554 transitions. Second operand 71 states. [2018-04-11 15:35:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:35:42,975 INFO L93 Difference]: Finished difference Result 565 states and 566 transitions. [2018-04-11 15:35:42,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-11 15:35:42,975 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 547 [2018-04-11 15:35:42,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:35:42,976 INFO L225 Difference]: With dead ends: 565 [2018-04-11 15:35:42,976 INFO L226 Difference]: Without dead ends: 565 [2018-04-11 15:35:42,977 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=6905, Invalid=11727, Unknown=0, NotChecked=0, Total=18632 [2018-04-11 15:35:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-04-11 15:35:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 561. [2018-04-11 15:35:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-04-11 15:35:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 562 transitions. [2018-04-11 15:35:42,979 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 562 transitions. Word has length 547 [2018-04-11 15:35:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:35:42,980 INFO L459 AbstractCegarLoop]: Abstraction has 561 states and 562 transitions. [2018-04-11 15:35:42,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-11 15:35:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 562 transitions. [2018-04-11 15:35:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-04-11 15:35:42,981 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:35:42,981 INFO L355 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 66, 66, 66, 66, 1, 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 15:35:42,982 INFO L408 AbstractCegarLoop]: === Iteration 72 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:35:42,982 INFO L82 PathProgramCache]: Analyzing trace with hash -52929514, now seen corresponding path program 60 times [2018-04-11 15:35:42,982 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:35:42,982 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:35:42,982 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:42,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:35:42,982 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:35:43,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:35:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 8712 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2018-04-11 15:35:44,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:35:44,865 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:35:44,866 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:35:45,017 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-04-11 15:35:45,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:35:45,059 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:35:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 8712 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2018-04-11 15:35:45,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:35:45,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 69] total 72 [2018-04-11 15:35:45,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-11 15:35:45,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-11 15:35:45,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=2693, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 15:35:45,170 INFO L87 Difference]: Start difference. First operand 561 states and 562 transitions. Second operand 72 states. [2018-04-11 15:35:46,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:35:46,612 INFO L93 Difference]: Finished difference Result 573 states and 574 transitions. [2018-04-11 15:35:46,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-11 15:35:46,612 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 555 [2018-04-11 15:35:46,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:35:46,613 INFO L225 Difference]: With dead ends: 573 [2018-04-11 15:35:46,613 INFO L226 Difference]: Without dead ends: 573 [2018-04-11 15:35:46,614 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2472 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=7110, Invalid=12072, Unknown=0, NotChecked=0, Total=19182 [2018-04-11 15:35:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-04-11 15:35:46,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 569. [2018-04-11 15:35:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-04-11 15:35:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 570 transitions. [2018-04-11 15:35:46,616 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 570 transitions. Word has length 555 [2018-04-11 15:35:46,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:35:46,616 INFO L459 AbstractCegarLoop]: Abstraction has 569 states and 570 transitions. [2018-04-11 15:35:46,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-11 15:35:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 570 transitions. [2018-04-11 15:35:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2018-04-11 15:35:46,618 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:35:46,618 INFO L355 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 67, 67, 67, 67, 1, 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 15:35:46,618 INFO L408 AbstractCegarLoop]: === Iteration 73 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:35:46,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1729187850, now seen corresponding path program 61 times [2018-04-11 15:35:46,619 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:35:46,619 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:35:46,619 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:46,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:35:46,619 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:35:46,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:35:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 8978 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2018-04-11 15:35:48,531 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:35:48,531 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:35:48,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:35:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:35:48,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:35:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 8978 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2018-04-11 15:35:49,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:35:49,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 71] total 140 [2018-04-11 15:35:49,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-04-11 15:35:49,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-04-11 15:35:49,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7246, Invalid=12214, Unknown=0, NotChecked=0, Total=19460 [2018-04-11 15:35:49,925 INFO L87 Difference]: Start difference. First operand 569 states and 570 transitions. Second operand 140 states. [2018-04-11 15:35:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:35:50,932 INFO L93 Difference]: Finished difference Result 581 states and 582 transitions. [2018-04-11 15:35:50,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-11 15:35:50,932 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 563 [2018-04-11 15:35:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:35:50,933 INFO L225 Difference]: With dead ends: 581 [2018-04-11 15:35:50,933 INFO L226 Difference]: Without dead ends: 581 [2018-04-11 15:35:50,934 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 495 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9177 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=7385, Invalid=12355, Unknown=0, NotChecked=0, Total=19740 [2018-04-11 15:35:50,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-04-11 15:35:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 577. [2018-04-11 15:35:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-04-11 15:35:50,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 578 transitions. [2018-04-11 15:35:50,937 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 578 transitions. Word has length 563 [2018-04-11 15:35:50,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:35:50,937 INFO L459 AbstractCegarLoop]: Abstraction has 577 states and 578 transitions. [2018-04-11 15:35:50,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-04-11 15:35:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 578 transitions. [2018-04-11 15:35:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-04-11 15:35:50,939 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:35:50,939 INFO L355 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 68, 68, 68, 68, 1, 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 15:35:50,939 INFO L408 AbstractCegarLoop]: === Iteration 74 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:35:50,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2023034070, now seen corresponding path program 62 times [2018-04-11 15:35:50,940 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:35:50,940 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:35:50,940 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:50,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:35:50,940 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:35:50,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:35:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2018-04-11 15:35:52,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:35:52,958 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:35:52,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:35:53,025 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:35:53,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:35:53,036 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:35:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2018-04-11 15:35:53,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:35:53,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 71] total 74 [2018-04-11 15:35:53,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-11 15:35:53,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-11 15:35:53,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2560, Invalid=2842, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 15:35:53,143 INFO L87 Difference]: Start difference. First operand 577 states and 578 transitions. Second operand 74 states. [2018-04-11 15:35:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:35:54,673 INFO L93 Difference]: Finished difference Result 589 states and 590 transitions. [2018-04-11 15:35:54,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-11 15:35:54,673 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 571 [2018-04-11 15:35:54,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:35:54,674 INFO L225 Difference]: With dead ends: 589 [2018-04-11 15:35:54,674 INFO L226 Difference]: Without dead ends: 589 [2018-04-11 15:35:54,675 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 640 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2615 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=7529, Invalid=12777, Unknown=0, NotChecked=0, Total=20306 [2018-04-11 15:35:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-04-11 15:35:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 585. [2018-04-11 15:35:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-04-11 15:35:54,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 586 transitions. [2018-04-11 15:35:54,677 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 586 transitions. Word has length 571 [2018-04-11 15:35:54,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:35:54,677 INFO L459 AbstractCegarLoop]: Abstraction has 585 states and 586 transitions. [2018-04-11 15:35:54,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-11 15:35:54,677 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 586 transitions. [2018-04-11 15:35:54,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-04-11 15:35:54,679 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:35:54,679 INFO L355 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 69, 69, 69, 69, 1, 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 15:35:54,679 INFO L408 AbstractCegarLoop]: === Iteration 75 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:35:54,679 INFO L82 PathProgramCache]: Analyzing trace with hash 110490294, now seen corresponding path program 63 times [2018-04-11 15:35:54,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:35:54,680 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:35:54,680 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:54,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:35:54,680 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:35:54,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:35:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2018-04-11 15:35:56,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:35:56,747 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:35:56,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:35:56,861 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-04-11 15:35:56,861 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:35:56,882 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:35:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2018-04-11 15:35:56,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:35:56,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 72] total 75 [2018-04-11 15:35:56,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-11 15:35:56,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-11 15:35:56,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2632, Invalid=2918, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 15:35:56,992 INFO L87 Difference]: Start difference. First operand 585 states and 586 transitions. Second operand 75 states. [2018-04-11 15:35:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:35:58,565 INFO L93 Difference]: Finished difference Result 597 states and 598 transitions. [2018-04-11 15:35:58,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-11 15:35:58,565 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 579 [2018-04-11 15:35:58,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:35:58,566 INFO L225 Difference]: With dead ends: 597 [2018-04-11 15:35:58,566 INFO L226 Difference]: Without dead ends: 597 [2018-04-11 15:35:58,567 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2688 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=7743, Invalid=13137, Unknown=0, NotChecked=0, Total=20880 [2018-04-11 15:35:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-04-11 15:35:58,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 593. [2018-04-11 15:35:58,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-04-11 15:35:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 594 transitions. [2018-04-11 15:35:58,570 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 594 transitions. Word has length 579 [2018-04-11 15:35:58,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:35:58,570 INFO L459 AbstractCegarLoop]: Abstraction has 593 states and 594 transitions. [2018-04-11 15:35:58,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-11 15:35:58,570 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 594 transitions. [2018-04-11 15:35:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2018-04-11 15:35:58,572 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:35:58,572 INFO L355 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 70, 70, 70, 70, 1, 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 15:35:58,572 INFO L408 AbstractCegarLoop]: === Iteration 76 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:35:58,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1568399766, now seen corresponding path program 64 times [2018-04-11 15:35:58,572 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:35:58,572 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:35:58,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:58,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:35:58,573 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:35:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:35:58,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 0 proven. 9800 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2018-04-11 15:36:00,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:00,691 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:00,691 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:36:00,929 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:36:00,929 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:36:00,951 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:00,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:36:00,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:36:00,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:36:00,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:36:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 9800 proven. 9800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:36:07,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:07,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 146] total 219 [2018-04-11 15:36:07,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-04-11 15:36:07,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-04-11 15:36:07,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10658, Invalid=37084, Unknown=0, NotChecked=0, Total=47742 [2018-04-11 15:36:07,418 INFO L87 Difference]: Start difference. First operand 593 states and 594 transitions. Second operand 219 states. [2018-04-11 15:36:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:10,755 INFO L93 Difference]: Finished difference Result 605 states and 606 transitions. [2018-04-11 15:36:10,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-11 15:36:10,755 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 587 [2018-04-11 15:36:10,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:10,756 INFO L225 Difference]: With dead ends: 605 [2018-04-11 15:36:10,756 INFO L226 Difference]: Without dead ends: 605 [2018-04-11 15:36:10,758 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 444 SyntacticMatches, 1 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35709 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=18625, Invalid=66931, Unknown=0, NotChecked=0, Total=85556 [2018-04-11 15:36:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-04-11 15:36:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 601. [2018-04-11 15:36:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-04-11 15:36:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 602 transitions. [2018-04-11 15:36:10,761 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 602 transitions. Word has length 587 [2018-04-11 15:36:10,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:10,761 INFO L459 AbstractCegarLoop]: Abstraction has 601 states and 602 transitions. [2018-04-11 15:36:10,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-04-11 15:36:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 602 transitions. [2018-04-11 15:36:10,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2018-04-11 15:36:10,763 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:10,763 INFO L355 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 71, 71, 71, 71, 1, 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 15:36:10,763 INFO L408 AbstractCegarLoop]: === Iteration 77 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:36:10,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1737578870, now seen corresponding path program 65 times [2018-04-11 15:36:10,763 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:10,763 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:10,763 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:10,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:36:10,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:10,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 10082 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2018-04-11 15:36:12,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:12,933 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:12,934 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:36:13,131 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-04-11 15:36:13,131 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:36:13,141 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 10082 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2018-04-11 15:36:13,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:13,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 74] total 77 [2018-04-11 15:36:13,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-11 15:36:13,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-11 15:36:13,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2779, Invalid=3073, Unknown=0, NotChecked=0, Total=5852 [2018-04-11 15:36:13,257 INFO L87 Difference]: Start difference. First operand 601 states and 602 transitions. Second operand 77 states. [2018-04-11 15:36:14,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:14,889 INFO L93 Difference]: Finished difference Result 613 states and 614 transitions. [2018-04-11 15:36:14,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-11 15:36:14,889 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 595 [2018-04-11 15:36:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:14,890 INFO L225 Difference]: With dead ends: 613 [2018-04-11 15:36:14,890 INFO L226 Difference]: Without dead ends: 613 [2018-04-11 15:36:14,891 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 667 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2837 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=8180, Invalid=13872, Unknown=0, NotChecked=0, Total=22052 [2018-04-11 15:36:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-04-11 15:36:14,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 609. [2018-04-11 15:36:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-04-11 15:36:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 610 transitions. [2018-04-11 15:36:14,894 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 610 transitions. Word has length 595 [2018-04-11 15:36:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:14,894 INFO L459 AbstractCegarLoop]: Abstraction has 609 states and 610 transitions. [2018-04-11 15:36:14,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-11 15:36:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 610 transitions. [2018-04-11 15:36:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-04-11 15:36:14,896 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:14,896 INFO L355 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 72, 72, 72, 72, 1, 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 15:36:14,896 INFO L408 AbstractCegarLoop]: === Iteration 78 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:36:14,896 INFO L82 PathProgramCache]: Analyzing trace with hash -18818474, now seen corresponding path program 66 times [2018-04-11 15:36:14,896 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:14,896 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:14,897 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:14,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:36:14,897 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:14,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 10368 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2018-04-11 15:36:17,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:17,175 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:17,175 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:36:17,364 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-04-11 15:36:17,365 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:36:17,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 10368 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2018-04-11 15:36:17,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:17,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 75] total 78 [2018-04-11 15:36:17,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-11 15:36:17,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-11 15:36:17,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2854, Invalid=3152, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 15:36:17,516 INFO L87 Difference]: Start difference. First operand 609 states and 610 transitions. Second operand 78 states. [2018-04-11 15:36:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:19,202 INFO L93 Difference]: Finished difference Result 621 states and 622 transitions. [2018-04-11 15:36:19,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-11 15:36:19,202 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 603 [2018-04-11 15:36:19,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:19,203 INFO L225 Difference]: With dead ends: 621 [2018-04-11 15:36:19,203 INFO L226 Difference]: Without dead ends: 621 [2018-04-11 15:36:19,204 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 676 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2913 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=8403, Invalid=14247, Unknown=0, NotChecked=0, Total=22650 [2018-04-11 15:36:19,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-04-11 15:36:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 617. [2018-04-11 15:36:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-04-11 15:36:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 618 transitions. [2018-04-11 15:36:19,207 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 618 transitions. Word has length 603 [2018-04-11 15:36:19,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:19,207 INFO L459 AbstractCegarLoop]: Abstraction has 617 states and 618 transitions. [2018-04-11 15:36:19,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-11 15:36:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 618 transitions. [2018-04-11 15:36:19,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2018-04-11 15:36:19,209 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:19,209 INFO L355 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 73, 73, 73, 73, 1, 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 15:36:19,209 INFO L408 AbstractCegarLoop]: === Iteration 79 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:36:19,209 INFO L82 PathProgramCache]: Analyzing trace with hash 221570102, now seen corresponding path program 67 times [2018-04-11 15:36:19,209 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:19,209 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:19,210 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:19,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:36:19,210 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:19,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 10658 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2018-04-11 15:36:21,544 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:21,544 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:21,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:21,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:23,204 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 10658 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2018-04-11 15:36:23,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:23,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 77] total 152 [2018-04-11 15:36:23,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-04-11 15:36:23,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-04-11 15:36:23,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8551, Invalid=14401, Unknown=0, NotChecked=0, Total=22952 [2018-04-11 15:36:23,207 INFO L87 Difference]: Start difference. First operand 617 states and 618 transitions. Second operand 152 states. [2018-04-11 15:36:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:24,395 INFO L93 Difference]: Finished difference Result 629 states and 630 transitions. [2018-04-11 15:36:24,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-11 15:36:24,396 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 611 [2018-04-11 15:36:24,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:24,397 INFO L225 Difference]: With dead ends: 629 [2018-04-11 15:36:24,397 INFO L226 Difference]: Without dead ends: 629 [2018-04-11 15:36:24,397 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 537 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10875 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=8702, Invalid=14554, Unknown=0, NotChecked=0, Total=23256 [2018-04-11 15:36:24,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-04-11 15:36:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 625. [2018-04-11 15:36:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-04-11 15:36:24,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 626 transitions. [2018-04-11 15:36:24,400 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 626 transitions. Word has length 611 [2018-04-11 15:36:24,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:24,400 INFO L459 AbstractCegarLoop]: Abstraction has 625 states and 626 transitions. [2018-04-11 15:36:24,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-04-11 15:36:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 626 transitions. [2018-04-11 15:36:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2018-04-11 15:36:24,402 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:24,402 INFO L355 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 74, 74, 74, 74, 1, 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 15:36:24,402 INFO L408 AbstractCegarLoop]: === Iteration 80 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-11 15:36:24,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1407715562, now seen corresponding path program 68 times [2018-04-11 15:36:24,402 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:24,402 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:24,403 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:24,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:24,403 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:24,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:26,789 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 10952 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2018-04-11 15:36:26,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:26,822 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:26,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:36:26,908 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:36:26,908 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:36:26,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 10952 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2018-04-11 15:36:27,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:27,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 77] total 80 [2018-04-11 15:36:27,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-11 15:36:27,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-11 15:36:27,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3007, Invalid=3313, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 15:36:27,050 INFO L87 Difference]: Start difference. First operand 625 states and 626 transitions. Second operand 80 states. Received shutdown request... [2018-04-11 15:36:27,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-11 15:36:27,552 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 15:36:27,555 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 15:36:27,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:36:27 BoogieIcfgContainer [2018-04-11 15:36:27,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:36:27,555 INFO L168 Benchmark]: Toolchain (without parser) took 174795.76 ms. Allocated memory was 404.8 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 335.6 MB in the beginning and 358.4 MB in the end (delta: -22.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-04-11 15:36:27,556 INFO L168 Benchmark]: CDTParser took 0.18 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 15:36:27,556 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.80 ms. Allocated memory is still 404.8 MB. Free memory was 335.6 MB in the beginning and 311.7 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-11 15:36:27,557 INFO L168 Benchmark]: Boogie Preprocessor took 34.41 ms. Allocated memory is still 404.8 MB. Free memory was 311.7 MB in the beginning and 309.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-04-11 15:36:27,557 INFO L168 Benchmark]: RCFGBuilder took 378.03 ms. Allocated memory was 404.8 MB in the beginning and 595.6 MB in the end (delta: 190.8 MB). Free memory was 309.0 MB in the beginning and 533.3 MB in the end (delta: -224.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-04-11 15:36:27,557 INFO L168 Benchmark]: TraceAbstraction took 174154.68 ms. Allocated memory was 595.6 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 533.3 MB in the beginning and 358.4 MB in the end (delta: 174.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-04-11 15:36:27,558 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.18 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 225.80 ms. Allocated memory is still 404.8 MB. Free memory was 335.6 MB in the beginning and 311.7 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.41 ms. Allocated memory is still 404.8 MB. Free memory was 311.7 MB in the beginning and 309.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 378.03 ms. Allocated memory was 404.8 MB in the beginning and 595.6 MB in the end (delta: 190.8 MB). Free memory was 309.0 MB in the beginning and 533.3 MB in the end (delta: -224.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 174154.68 ms. Allocated memory was 595.6 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 533.3 MB in the beginning and 358.4 MB in the end (delta: 174.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 625]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 625]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 629]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 629). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (625states) and interpolant automaton (currently 42 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 17 error locations. TIMEOUT Result, 174.1s OverallTime, 80 OverallIterations, 75 TraceHistogramMax, 55.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2308 SDtfs, 38312 SDslu, 57330 SDs, 0 SdLazy, 37447 SolverSat, 9508 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30457 GetRequests, 23524 SyntacticMatches, 36 SemanticMatches, 6896 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290914 ImplicationChecksByTransitivity, 102.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=625occurred in iteration=79, 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.2s AutomataMinimizationTime, 79 MinimizatonAttempts, 331 StatesRemovedByMinimization, 75 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 106.8s InterpolantComputationTime, 48320 NumberOfCodeBlocks, 47834 NumberOfCodeBlocksAsserted, 1514 NumberOfCheckSat, 48059 ConstructedInterpolants, 130 QuantifiedInterpolants, 75407590 SizeOfPredicates, 155 NumberOfNonLiveVariables, 59673 ConjunctsInSsa, 3572 ConjunctsInUnsatCore, 152 InterpolantComputations, 7 PerfectInterpolantSequences, 551036/1102228 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/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-36-27-562.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-36-27-562.csv Completed graceful shutdown