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-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:30:47,889 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:30:47,890 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:30:47,902 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:30:47,903 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:30:47,903 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:30:47,904 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:30:47,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:30:47,907 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:30:47,908 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:30:47,908 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:30:47,909 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:30:47,909 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:30:47,910 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:30:47,911 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:30:47,912 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:30:47,914 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:30:47,915 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:30:47,916 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:30:47,917 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:30:47,918 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:30:47,918 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:30:47,919 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:30:47,919 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:30:47,920 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:30:47,921 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:30:47,921 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:30:47,922 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:30:47,922 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:30:47,922 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:30:47,922 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:30:47,923 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:30:47,941 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:30:47,942 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:30:47,942 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:30:47,943 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:30:47,943 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:30:47,943 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:30:47,943 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:30:47,943 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:30:47,943 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:30:47,943 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:30:47,943 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:30:47,943 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:30:47,944 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:30:47,944 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:30:47,944 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:30:47,944 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:30:47,944 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:30:47,944 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:30:47,944 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:30:47,944 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:30:47,944 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:30:47,945 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:30:47,945 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:30:47,945 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:30:47,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:30:47,979 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:30:47,981 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:30:47,982 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:30:47,982 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:30:47,983 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-deref.i [2018-04-11 15:30:48,313 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG563ff2610 [2018-04-11 15:30:48,439 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:30:48,440 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:30:48,440 INFO L168 CDTParser]: Scanning 960521-1_false-valid-deref.i [2018-04-11 15:30:48,446 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:30:48,446 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:30:48,446 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:30:48,447 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_f_________false_valid_deref_i__foo ('foo') in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,447 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,447 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:30:48,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____fsblkcnt64_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____uint64_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__ssize_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____swblk_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__pthread_once_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____uid_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__u_short in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__ino_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__wchar_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____socklen_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__u_int64_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__loff_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____useconds_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____fsfilcnt64_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__b in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__id_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__a in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__ldiv_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____int64_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__dev_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____intptr_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__size_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__off_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__pthread_attr_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____u_int in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__register_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__quad_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__n in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____clockid_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__pthread_cond_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__pthread_mutex_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__suseconds_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____loff_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____u_short in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__int64_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__fsid_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__u_int16_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____WAIT_STATUS in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__ushort in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____clock_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__div_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____uint8_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____key_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____time_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__pthread_spinlock_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____mode_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__int8_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____fsfilcnt_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____rlim64_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____daddr_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____ino_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__caddr_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____sigset_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__pid_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__daddr_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__clock_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__fd_set in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____uint16_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____fsid_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__gid_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__pthread_condattr_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__u_long in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____caddr_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__mode_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____dev_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____int8_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__u_int32_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__sigset_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__ulong in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____u_long in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____off64_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____u_char in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__u_quad_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____blksize_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__blksize_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____qaddr_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__uid_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__pthread_rwlock_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__lldiv_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____uint32_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____int16_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__pthread_barrier_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__time_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__u_char in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__pthread_key_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__int16_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____fsblkcnt_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__blkcnt_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____pthread_list_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__pthread_barrierattr_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____blkcnt_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____rlim_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,454 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__u_int in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,454 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____int32_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,454 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__fd_mask in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,454 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____u_quad_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,454 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____suseconds_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,454 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____timer_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,454 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__fsblkcnt_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,454 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____gid_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,454 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____quad_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,454 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__pthread_mutexattr_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,454 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____pid_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,454 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____ino64_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,454 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__u_int8_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,455 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____fd_mask in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,455 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__nlink_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,455 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__uint in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,455 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__int32_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,455 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____blkcnt64_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,455 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____off_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,455 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__pthread_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,455 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__fsfilcnt_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,455 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____id_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,455 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__pthread_rwlockattr_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,455 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____nlink_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,455 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____sig_atomic_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,455 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__clockid_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,455 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__key_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,455 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i____ssize_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,455 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_deref_i__timer_t in 960521-1_false-valid-deref.i [2018-04-11 15:30:48,469 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG563ff2610 [2018-04-11 15:30:48,472 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:30:48,473 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:30:48,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:30:48,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:30:48,478 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:30:48,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:30:48" (1/1) ... [2018-04-11 15:30:48,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59db2e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:30:48, skipping insertion in model container [2018-04-11 15:30:48,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:30:48" (1/1) ... [2018-04-11 15:30:48,496 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:30:48,522 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:30:48,654 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:30:48,682 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:30:48,688 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 111 non ball SCCs. Number of states in SCCs 111. [2018-04-11 15:30:48,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:30:48 WrapperNode [2018-04-11 15:30:48,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:30:48,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:30:48,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:30:48,719 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:30:48,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:30:48" (1/1) ... [2018-04-11 15:30:48,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:30:48" (1/1) ... [2018-04-11 15:30:48,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:30:48" (1/1) ... [2018-04-11 15:30:48,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:30:48" (1/1) ... [2018-04-11 15:30:48,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:30:48" (1/1) ... [2018-04-11 15:30:48,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:30:48" (1/1) ... [2018-04-11 15:30:48,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:30:48" (1/1) ... [2018-04-11 15:30:48,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:30:48,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:30:48,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:30:48,759 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:30:48,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:30:48" (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:30:48,841 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:30:48,841 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:30:48,841 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_________false_valid_deref_i__foo [2018-04-11 15:30:48,841 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:30:48,842 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 15:30:48,842 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:30:48,842 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:30:48,842 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:30:48,842 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:30:48,842 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:30:48,842 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:30:48,842 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:30:48,842 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:30:48,842 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:30:48,842 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:30:48,843 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:30:48,843 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:30:48,843 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:30:48,843 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:30:48,843 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:30:48,843 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:30:48,843 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:30:48,843 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:30:48,843 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:30:48,843 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:30:48,844 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:30:48,844 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:30:48,844 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:30:48,844 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:30:48,844 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:30:48,844 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:30:48,844 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:30:48,844 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:30:48,844 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:30:48,844 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:30:48,845 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:30:48,845 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:30:48,845 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:30:48,845 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:30:48,845 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:30:48,845 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:30:48,845 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:30:48,845 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:30:48,845 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:30:48,845 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:30:48,846 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:30:48,846 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:30:48,846 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:30:48,846 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:30:48,846 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:30:48,846 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:30:48,846 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:30:48,846 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:30:48,846 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:30:48,847 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:30:48,847 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:30:48,847 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:30:48,847 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:30:48,847 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:30:48,847 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:30:48,847 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:30:48,847 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:30:48,847 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:30:48,847 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:30:48,848 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:30:48,848 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:30:48,848 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:30:48,848 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:30:48,848 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:30:48,848 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 15:30:48,848 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:30:48,848 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:30:48,848 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:30:48,848 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:30:48,849 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:30:48,849 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:30:48,849 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:30:48,849 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:30:48,849 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:30:48,849 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:30:48,849 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:30:48,849 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:30:48,849 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:30:48,849 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:30:48,849 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:30:48,849 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:30:48,849 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:30:48,849 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:30:48,850 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:30:48,850 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:30:48,850 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:30:48,850 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:30:48,850 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:30:48,850 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:30:48,850 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:30:48,850 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:30:48,850 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:30:48,850 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:30:48,850 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:30:48,850 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:30:48,850 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:30:48,851 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:30:48,851 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:30:48,851 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:30:48,851 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:30:48,851 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:30:48,851 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_________false_valid_deref_i__foo [2018-04-11 15:30:48,851 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:30:48,851 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:30:48,851 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:30:48,851 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:30:48,852 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:30:48,852 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:30:48,852 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:30:48,852 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:30:49,100 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:30:49,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:30:49 BoogieIcfgContainer [2018-04-11 15:30:49,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:30:49,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:30:49,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:30:49,103 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:30:49,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:30:48" (1/3) ... [2018-04-11 15:30:49,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5144cd68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:30:49, skipping insertion in model container [2018-04-11 15:30:49,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:30:48" (2/3) ... [2018-04-11 15:30:49,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5144cd68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:30:49, skipping insertion in model container [2018-04-11 15:30:49,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:30:49" (3/3) ... [2018-04-11 15:30:49,105 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-deref.i [2018-04-11 15:30:49,111 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:30:49,116 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-04-11 15:30:49,146 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:30:49,146 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:30:49,146 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:30:49,146 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:30:49,147 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:30:49,147 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:30:49,147 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:30:49,147 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:30:49,147 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:30:49,148 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:30:49,160 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-04-11 15:30:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 15:30:49,167 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:49,168 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:30:49,168 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:49,170 INFO L82 PathProgramCache]: Analyzing trace with hash 516560539, now seen corresponding path program 1 times [2018-04-11 15:30:49,171 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:49,172 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:49,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:49,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:49,201 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:49,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:49,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:30:49,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:30:49,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:30:49,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:30:49,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:30:49,310 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-04-11 15:30:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:49,384 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-04-11 15:30:49,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:30:49,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-04-11 15:30:49,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:49,393 INFO L225 Difference]: With dead ends: 60 [2018-04-11 15:30:49,393 INFO L226 Difference]: Without dead ends: 57 [2018-04-11 15:30:49,395 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:30:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-11 15:30:49,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-04-11 15:30:49,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-11 15:30:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-04-11 15:30:49,421 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 11 [2018-04-11 15:30:49,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:49,421 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-04-11 15:30:49,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:30:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-04-11 15:30:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 15:30:49,422 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:49,422 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:30:49,422 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:49,422 INFO L82 PathProgramCache]: Analyzing trace with hash 516560540, now seen corresponding path program 1 times [2018-04-11 15:30:49,422 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:49,422 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:49,423 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:49,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:49,423 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:49,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:49,515 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:30:49,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:30:49,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:30:49,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:30:49,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:30:49,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:30:49,517 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2018-04-11 15:30:49,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:49,578 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-04-11 15:30:49,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:30:49,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-04-11 15:30:49,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:49,579 INFO L225 Difference]: With dead ends: 56 [2018-04-11 15:30:49,579 INFO L226 Difference]: Without dead ends: 56 [2018-04-11 15:30:49,580 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:30:49,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-04-11 15:30:49,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-04-11 15:30:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 15:30:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-04-11 15:30:49,583 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 11 [2018-04-11 15:30:49,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:49,583 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-04-11 15:30:49,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:30:49,583 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-04-11 15:30:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 15:30:49,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:49,583 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:30:49,583 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:49,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1337247429, now seen corresponding path program 1 times [2018-04-11 15:30:49,583 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:49,584 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:49,584 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:49,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:49,584 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:49,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:49,603 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:30:49,603 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:49,604 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:49,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:49,647 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:49,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:30:49,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:49,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:30:49,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:30:49,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:30:49,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:30:49,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:30:49,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:49,694 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:30:49,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 15:30:49,711 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:30:49,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:30:49,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:30:49,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:30:49,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:30:49,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:30:49,712 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 5 states. [2018-04-11 15:30:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:49,801 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-04-11 15:30:49,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:30:49,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-11 15:30:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:49,802 INFO L225 Difference]: With dead ends: 53 [2018-04-11 15:30:49,802 INFO L226 Difference]: Without dead ends: 53 [2018-04-11 15:30:49,802 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:30:49,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-11 15:30:49,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-04-11 15:30:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-11 15:30:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-04-11 15:30:49,806 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 17 [2018-04-11 15:30:49,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:49,806 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-04-11 15:30:49,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:30:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-04-11 15:30:49,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 15:30:49,807 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:49,807 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:30:49,807 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:49,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1337247430, now seen corresponding path program 1 times [2018-04-11 15:30:49,808 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:49,808 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:49,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:49,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:49,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:49,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:49,826 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:30:49,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:49,826 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:49,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:49,856 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:49,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:30:49,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:49,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:30:49,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:49,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:30:49,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-11 15:30:49,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:30:49,917 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:30:49,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:49,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:30:49,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:30:49,952 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:30:49,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:49,960 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:30:49,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-04-11 15:30:49,995 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:30:49,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:30:49,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:30:49,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:30:49,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:30:49,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:30:49,996 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 7 states. [2018-04-11 15:30:50,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:50,201 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-04-11 15:30:50,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:30:50,202 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-04-11 15:30:50,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:50,203 INFO L225 Difference]: With dead ends: 61 [2018-04-11 15:30:50,203 INFO L226 Difference]: Without dead ends: 61 [2018-04-11 15:30:50,203 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:30:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-04-11 15:30:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2018-04-11 15:30:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 15:30:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-04-11 15:30:50,206 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 17 [2018-04-11 15:30:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:50,206 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-04-11 15:30:50,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:30:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-04-11 15:30:50,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 15:30:50,206 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:50,206 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:30:50,206 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:50,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1186083357, now seen corresponding path program 1 times [2018-04-11 15:30:50,207 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:50,207 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:50,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:50,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:50,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:50,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:50,229 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:30:50,230 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:50,230 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:50,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:50,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:50,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:30:50,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:50,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:30:50,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:50,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:30:50,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-11 15:30:50,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:30:50,308 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:30:50,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:50,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:30:50,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:30:50,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:30:50,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:50,324 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:30:50,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-04-11 15:30:50,393 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:30:50,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:30:50,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 15:30:50,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:30:50,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:30:50,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:30:50,394 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 9 states. [2018-04-11 15:30:50,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:50,688 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-04-11 15:30:50,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:30:50,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-11 15:30:50,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:50,689 INFO L225 Difference]: With dead ends: 65 [2018-04-11 15:30:50,689 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 15:30:50,689 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:30:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 15:30:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-04-11 15:30:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 15:30:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-04-11 15:30:50,692 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 21 [2018-04-11 15:30:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:50,692 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-04-11 15:30:50,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:30:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-04-11 15:30:50,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:30:50,692 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:50,692 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:30:50,692 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:50,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1607211508, now seen corresponding path program 2 times [2018-04-11 15:30:50,693 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:50,693 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:50,693 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:50,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:50,694 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:50,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:50,716 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:30:50,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:50,717 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:50,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:30:50,748 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:30:50,748 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:50,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:50,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:30:50,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:50,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:30:50,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:50,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:30:50,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-11 15:30:50,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:30:50,791 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:30:50,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:50,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:30:50,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:30:50,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:30:50,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:50,819 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:30:50,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-04-11 15:30:50,899 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:30:50,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:30:50,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 15:30:50,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:30:50,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:30:50,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:30:50,901 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 9 states. [2018-04-11 15:30:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:51,177 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-04-11 15:30:51,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:30:51,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-04-11 15:30:51,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:51,178 INFO L225 Difference]: With dead ends: 81 [2018-04-11 15:30:51,178 INFO L226 Difference]: Without dead ends: 81 [2018-04-11 15:30:51,178 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:30:51,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-11 15:30:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-04-11 15:30:51,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-11 15:30:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-04-11 15:30:51,182 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 25 [2018-04-11 15:30:51,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:51,182 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-04-11 15:30:51,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:30:51,182 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-04-11 15:30:51,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:30:51,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:51,183 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:30:51,183 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:51,183 INFO L82 PathProgramCache]: Analyzing trace with hash 124796491, now seen corresponding path program 3 times [2018-04-11 15:30:51,183 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:51,183 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:51,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:51,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:51,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:51,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:51,202 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:30:51,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:51,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:51,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:30:51,221 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-04-11 15:30:51,221 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:51,224 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:51,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:30:51,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:51,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:30:51,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:51,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:30:51,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-11 15:30:51,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:30:51,258 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:30:51,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:51,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:30:51,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:30:51,266 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:30:51,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:51,270 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:30:51,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-11 15:30:51,357 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:30:51,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:30:51,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 15:30:51,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:30:51,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:30:51,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:30:51,358 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 9 states. [2018-04-11 15:30:51,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:51,531 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-04-11 15:30:51,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:30:51,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-04-11 15:30:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:51,532 INFO L225 Difference]: With dead ends: 73 [2018-04-11 15:30:51,532 INFO L226 Difference]: Without dead ends: 73 [2018-04-11 15:30:51,532 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:30:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-11 15:30:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2018-04-11 15:30:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-11 15:30:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-04-11 15:30:51,535 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 29 [2018-04-11 15:30:51,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:51,536 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-04-11 15:30:51,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:30:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-04-11 15:30:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:30:51,536 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:51,537 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:30:51,537 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:51,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1631061243, now seen corresponding path program 1 times [2018-04-11 15:30:51,537 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:51,537 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:51,538 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:51,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:51,538 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:51,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:51,564 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:30:51,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:30:51,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:30:51,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:30:51,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:30:51,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:30:51,566 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 4 states. [2018-04-11 15:30:51,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:51,595 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-04-11 15:30:51,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:30:51,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-04-11 15:30:51,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:51,596 INFO L225 Difference]: With dead ends: 68 [2018-04-11 15:30:51,596 INFO L226 Difference]: Without dead ends: 68 [2018-04-11 15:30:51,596 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:30:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-11 15:30:51,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-04-11 15:30:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-11 15:30:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-04-11 15:30:51,598 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 32 [2018-04-11 15:30:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:51,598 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-04-11 15:30:51,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:30:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-04-11 15:30:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:30:51,599 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:51,599 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:30:51,599 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:51,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1631061242, now seen corresponding path program 1 times [2018-04-11 15:30:51,599 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:51,599 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:51,600 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:51,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:51,600 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:51,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:51,645 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:30:51,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:51,646 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:51,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:51,659 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:51,687 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:30:51,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:51,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-04-11 15:30:51,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:30:51,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:30:51,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:30:51,688 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 11 states. [2018-04-11 15:30:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:51,725 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-04-11 15:30:51,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:30:51,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-04-11 15:30:51,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:51,726 INFO L225 Difference]: With dead ends: 84 [2018-04-11 15:30:51,726 INFO L226 Difference]: Without dead ends: 84 [2018-04-11 15:30:51,726 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:30:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-11 15:30:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2018-04-11 15:30:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-11 15:30:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-04-11 15:30:51,729 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 32 [2018-04-11 15:30:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:51,729 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-04-11 15:30:51,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:30:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-04-11 15:30:51,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:30:51,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:51,729 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:30:51,729 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:51,730 INFO L82 PathProgramCache]: Analyzing trace with hash -830892337, now seen corresponding path program 2 times [2018-04-11 15:30:51,730 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:51,730 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:51,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:51,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:51,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:51,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:51,784 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:30:51,784 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:51,785 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:51,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:30:51,794 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-11 15:30:51,794 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:51,796 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:51,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:30:51,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:51,804 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:30:51,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-11 15:30:51,862 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:30:51,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:30:51,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-04-11 15:30:51,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:30:51,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:30:51,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:30:51,863 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 12 states. [2018-04-11 15:30:52,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:52,177 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-04-11 15:30:52,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:30:52,177 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-04-11 15:30:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:52,179 INFO L225 Difference]: With dead ends: 74 [2018-04-11 15:30:52,179 INFO L226 Difference]: Without dead ends: 74 [2018-04-11 15:30:52,179 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:30:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-11 15:30:52,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2018-04-11 15:30:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 15:30:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-04-11 15:30:52,181 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 36 [2018-04-11 15:30:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:52,182 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-04-11 15:30:52,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:30:52,182 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-04-11 15:30:52,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:30:52,182 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:52,182 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:30:52,182 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:52,183 INFO L82 PathProgramCache]: Analyzing trace with hash -21492497, now seen corresponding path program 1 times [2018-04-11 15:30:52,183 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:52,183 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:52,183 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:52,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:52,183 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:52,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:52,247 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:30:52,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:52,247 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:52,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:52,261 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:52,321 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:30:52,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:52,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-04-11 15:30:52,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:30:52,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:30:52,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:30:52,323 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 15 states. [2018-04-11 15:30:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:52,400 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-04-11 15:30:52,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:30:52,400 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-04-11 15:30:52,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:52,401 INFO L225 Difference]: With dead ends: 81 [2018-04-11 15:30:52,401 INFO L226 Difference]: Without dead ends: 81 [2018-04-11 15:30:52,401 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:30:52,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-11 15:30:52,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-04-11 15:30:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-11 15:30:52,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-04-11 15:30:52,404 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 44 [2018-04-11 15:30:52,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:52,404 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-04-11 15:30:52,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:30:52,404 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-04-11 15:30:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 15:30:52,404 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:52,405 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:30:52,405 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:52,405 INFO L82 PathProgramCache]: Analyzing trace with hash -960937160, now seen corresponding path program 2 times [2018-04-11 15:30:52,405 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:52,405 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:52,405 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:52,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:52,405 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:52,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:52,488 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:30:52,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:52,489 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:52,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:30:52,506 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:30:52,506 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:52,509 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:52,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:30:52,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:52,518 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:30:52,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-11 15:30:52,631 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:30:52,631 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:30:52,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-04-11 15:30:52,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:30:52,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:30:52,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:30:52,632 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 15 states. [2018-04-11 15:30:52,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:52,989 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2018-04-11 15:30:52,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:30:52,990 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-04-11 15:30:52,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:52,990 INFO L225 Difference]: With dead ends: 85 [2018-04-11 15:30:52,990 INFO L226 Difference]: Without dead ends: 85 [2018-04-11 15:30:52,991 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:30:52,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-11 15:30:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2018-04-11 15:30:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-11 15:30:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-04-11 15:30:52,994 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 48 [2018-04-11 15:30:52,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:52,994 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-04-11 15:30:52,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:30:52,994 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-04-11 15:30:52,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:30:52,996 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:52,996 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] [2018-04-11 15:30:52,996 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:52,996 INFO L82 PathProgramCache]: Analyzing trace with hash -195979014, now seen corresponding path program 1 times [2018-04-11 15:30:52,996 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:52,996 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:52,997 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:52,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:52,997 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:53,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:53,110 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:30:53,112 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:53,112 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:53,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:53,134 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:53,228 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:30:53,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:53,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-04-11 15:30:53,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:30:53,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:30:53,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:30:53,229 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 20 states. [2018-04-11 15:30:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:53,300 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-04-11 15:30:53,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:30:53,300 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-04-11 15:30:53,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:53,301 INFO L225 Difference]: With dead ends: 91 [2018-04-11 15:30:53,301 INFO L226 Difference]: Without dead ends: 91 [2018-04-11 15:30:53,301 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 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:30:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-11 15:30:53,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-04-11 15:30:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-11 15:30:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-04-11 15:30:53,303 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 74 [2018-04-11 15:30:53,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:53,303 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-04-11 15:30:53,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:30:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-04-11 15:30:53,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-04-11 15:30:53,305 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:53,305 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] [2018-04-11 15:30:53,305 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:53,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1009702095, now seen corresponding path program 2 times [2018-04-11 15:30:53,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:53,305 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:53,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:53,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:53,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:53,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:53,385 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:30:53,386 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:53,386 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:53,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:30:53,408 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:30:53,409 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:53,412 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:53,422 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:30:53,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:53,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2018-04-11 15:30:53,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:30:53,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:30:53,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:30:53,423 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 14 states. [2018-04-11 15:30:53,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:53,533 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-04-11 15:30:53,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:30:53,533 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 86 [2018-04-11 15:30:53,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:53,533 INFO L225 Difference]: With dead ends: 99 [2018-04-11 15:30:53,533 INFO L226 Difference]: Without dead ends: 99 [2018-04-11 15:30:53,534 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=179, Invalid=327, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:30:53,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-11 15:30:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-04-11 15:30:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-11 15:30:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-04-11 15:30:53,535 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 86 [2018-04-11 15:30:53,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:53,535 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-04-11 15:30:53,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:30:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-04-11 15:30:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-11 15:30:53,536 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:53,536 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] [2018-04-11 15:30:53,536 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:53,536 INFO L82 PathProgramCache]: Analyzing trace with hash -760171183, now seen corresponding path program 3 times [2018-04-11 15:30:53,537 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:53,537 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:53,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:53,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:53,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:53,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:53,666 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:30:53,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:53,667 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:53,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:30:53,699 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-11 15:30:53,699 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:53,704 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:53,719 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:30:53,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:53,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2018-04-11 15:30:53,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:30:53,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:30:53,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:30:53,721 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 15 states. [2018-04-11 15:30:53,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:53,845 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-04-11 15:30:53,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:30:53,845 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2018-04-11 15:30:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:53,846 INFO L225 Difference]: With dead ends: 107 [2018-04-11 15:30:53,846 INFO L226 Difference]: Without dead ends: 107 [2018-04-11 15:30:53,846 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 104 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:30:53,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-11 15:30:53,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-04-11 15:30:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-11 15:30:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-04-11 15:30:53,849 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 94 [2018-04-11 15:30:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:53,849 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-04-11 15:30:53,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:30:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-04-11 15:30:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-04-11 15:30:53,850 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:53,850 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] [2018-04-11 15:30:53,850 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:53,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1923061361, now seen corresponding path program 4 times [2018-04-11 15:30:53,850 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:53,850 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:53,851 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:53,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:53,851 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:53,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:53,964 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:30:53,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:53,964 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:53,964 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:30:53,994 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:30:53,994 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:53,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:54,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:30:54,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:54,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:30:54,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:30:54,345 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:30:54,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:54,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26] total 39 [2018-04-11 15:30:54,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 15:30:54,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 15:30:54,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1144, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:30:54,346 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 39 states. [2018-04-11 15:30:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:54,641 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-04-11 15:30:54,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:30:54,641 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 102 [2018-04-11 15:30:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:54,641 INFO L225 Difference]: With dead ends: 115 [2018-04-11 15:30:54,641 INFO L226 Difference]: Without dead ends: 115 [2018-04-11 15:30:54,642 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 79 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:30:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-11 15:30:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-04-11 15:30:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-11 15:30:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-04-11 15:30:54,644 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 102 [2018-04-11 15:30:54,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:54,644 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-04-11 15:30:54,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 15:30:54,644 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-04-11 15:30:54,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-04-11 15:30:54,645 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:54,645 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] [2018-04-11 15:30:54,645 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:54,645 INFO L82 PathProgramCache]: Analyzing trace with hash 633556625, now seen corresponding path program 5 times [2018-04-11 15:30:54,645 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:54,645 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:54,646 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:54,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:54,646 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:54,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:54,793 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:30:54,793 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:54,793 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:54,794 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:30:54,821 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-11 15:30:54,821 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:54,825 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:54,847 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:30:54,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:54,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 17 [2018-04-11 15:30:54,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:30:54,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:30:54,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:30:54,848 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 17 states. [2018-04-11 15:30:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:54,992 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-04-11 15:30:54,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:30:54,992 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 110 [2018-04-11 15:30:54,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:54,993 INFO L225 Difference]: With dead ends: 123 [2018-04-11 15:30:54,993 INFO L226 Difference]: Without dead ends: 123 [2018-04-11 15:30:54,993 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 122 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:30:54,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-11 15:30:54,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-04-11 15:30:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-11 15:30:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-04-11 15:30:54,995 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 110 [2018-04-11 15:30:54,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:54,995 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-04-11 15:30:54,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:30:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-04-11 15:30:54,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-04-11 15:30:54,996 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:54,996 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] [2018-04-11 15:30:54,996 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:54,996 INFO L82 PathProgramCache]: Analyzing trace with hash 646012337, now seen corresponding path program 6 times [2018-04-11 15:30:54,996 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:54,996 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:54,997 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:54,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:54,997 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:55,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:55,121 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:30:55,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:55,122 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:55,122 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:30:55,157 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-11 15:30:55,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:55,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:55,191 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:30:55,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:55,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 18 [2018-04-11 15:30:55,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:30:55,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:30:55,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:30:55,192 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 18 states. [2018-04-11 15:30:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:55,357 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2018-04-11 15:30:55,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:30:55,358 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 118 [2018-04-11 15:30:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:55,358 INFO L225 Difference]: With dead ends: 131 [2018-04-11 15:30:55,358 INFO L226 Difference]: Without dead ends: 131 [2018-04-11 15:30:55,359 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=333, Invalid=597, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:30:55,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-11 15:30:55,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-04-11 15:30:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-11 15:30:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-04-11 15:30:55,362 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 118 [2018-04-11 15:30:55,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:55,362 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-04-11 15:30:55,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:30:55,362 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-04-11 15:30:55,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-04-11 15:30:55,363 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:55,363 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] [2018-04-11 15:30:55,363 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:55,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1199522769, now seen corresponding path program 7 times [2018-04-11 15:30:55,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:55,364 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:55,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:55,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:55,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:55,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:55,563 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:30:55,563 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:55,563 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:55,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:55,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:55,746 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:30:55,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:55,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2018-04-11 15:30:55,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 15:30:55,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 15:30:55,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=631, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:30:55,748 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 32 states. [2018-04-11 15:30:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:55,903 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-04-11 15:30:55,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:30:55,904 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2018-04-11 15:30:55,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:55,905 INFO L225 Difference]: With dead ends: 139 [2018-04-11 15:30:55,905 INFO L226 Difference]: Without dead ends: 139 [2018-04-11 15:30:55,905 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 112 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:30:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-11 15:30:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-04-11 15:30:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-11 15:30:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-04-11 15:30:55,908 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 126 [2018-04-11 15:30:55,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:55,908 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-04-11 15:30:55,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 15:30:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-04-11 15:30:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-04-11 15:30:55,910 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:55,910 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] [2018-04-11 15:30:55,910 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:55,910 INFO L82 PathProgramCache]: Analyzing trace with hash -744324879, now seen corresponding path program 8 times [2018-04-11 15:30:55,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:55,910 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:55,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:55,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:55,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:55,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:56,120 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:30:56,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:56,155 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:56,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:30:56,180 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:30:56,180 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:56,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:56,224 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:30:56,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:56,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 20 [2018-04-11 15:30:56,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:30:56,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:30:56,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:30:56,226 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 20 states. [2018-04-11 15:30:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:56,388 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-04-11 15:30:56,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:30:56,388 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 134 [2018-04-11 15:30:56,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:56,389 INFO L225 Difference]: With dead ends: 147 [2018-04-11 15:30:56,389 INFO L226 Difference]: Without dead ends: 147 [2018-04-11 15:30:56,389 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 149 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:30:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-11 15:30:56,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2018-04-11 15:30:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-11 15:30:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-04-11 15:30:56,391 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 134 [2018-04-11 15:30:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:56,391 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-04-11 15:30:56,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:30:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-04-11 15:30:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-04-11 15:30:56,391 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:56,392 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] [2018-04-11 15:30:56,392 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:56,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1846580497, now seen corresponding path program 9 times [2018-04-11 15:30:56,392 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:56,392 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:56,392 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:56,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:56,392 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:56,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:30:56,572 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:30:56,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:56,572 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:56,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:30:56,610 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-11 15:30:56,610 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:56,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:56,779 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:30:56,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:56,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2018-04-11 15:30:56,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 15:30:56,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 15:30:56,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=800, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:30:56,780 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 36 states. [2018-04-11 15:30:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:56,909 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2018-04-11 15:30:56,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:30:56,910 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 142 [2018-04-11 15:30:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:56,910 INFO L225 Difference]: With dead ends: 155 [2018-04-11 15:30:56,911 INFO L226 Difference]: Without dead ends: 155 [2018-04-11 15:30:56,911 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 126 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:30:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-11 15:30:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2018-04-11 15:30:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-11 15:30:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-04-11 15:30:56,914 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 142 [2018-04-11 15:30:56,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:56,914 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-04-11 15:30:56,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 15:30:56,914 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-04-11 15:30:56,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-04-11 15:30:56,915 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:56,915 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] [2018-04-11 15:30:56,915 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:56,916 INFO L82 PathProgramCache]: Analyzing trace with hash -231800783, now seen corresponding path program 10 times [2018-04-11 15:30:56,916 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:56,916 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:56,916 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:56,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:56,917 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:56,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:57,161 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:30:57,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:57,161 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:57,162 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:30:57,193 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:30:57,193 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:57,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:57,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:30:57,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:30:57,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:30:57,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:30:58,092 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:30:58,092 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:58,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 38] total 57 [2018-04-11 15:30:58,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-11 15:30:58,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-11 15:30:58,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=2470, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 15:30:58,094 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 57 states. [2018-04-11 15:30:58,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:58,664 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2018-04-11 15:30:58,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:30:58,664 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 150 [2018-04-11 15:30:58,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:58,665 INFO L225 Difference]: With dead ends: 163 [2018-04-11 15:30:58,665 INFO L226 Difference]: Without dead ends: 163 [2018-04-11 15:30:58,666 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1264, Invalid=4588, Unknown=0, NotChecked=0, Total=5852 [2018-04-11 15:30:58,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-11 15:30:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-04-11 15:30:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-11 15:30:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-04-11 15:30:58,668 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 150 [2018-04-11 15:30:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:58,668 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-04-11 15:30:58,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-11 15:30:58,668 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-04-11 15:30:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-04-11 15:30:58,668 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:58,668 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] [2018-04-11 15:30:58,668 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:58,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1403208273, now seen corresponding path program 11 times [2018-04-11 15:30:58,669 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:58,669 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:58,669 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:58,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:58,669 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:58,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:58,938 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:30:58,939 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:58,939 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:58,939 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:30:58,979 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-11 15:30:58,979 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:58,983 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:59,020 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:30:59,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:59,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 23 [2018-04-11 15:30:59,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:30:59,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:30:59,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:30:59,022 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 23 states. [2018-04-11 15:30:59,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:59,320 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2018-04-11 15:30:59,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:30:59,321 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 158 [2018-04-11 15:30:59,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:59,321 INFO L225 Difference]: With dead ends: 171 [2018-04-11 15:30:59,321 INFO L226 Difference]: Without dead ends: 171 [2018-04-11 15:30:59,322 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=593, Invalid=1047, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:30:59,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-11 15:30:59,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2018-04-11 15:30:59,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-11 15:30:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-04-11 15:30:59,325 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 158 [2018-04-11 15:30:59,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:59,325 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-04-11 15:30:59,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:30:59,325 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-04-11 15:30:59,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-04-11 15:30:59,326 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:59,326 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] [2018-04-11 15:30:59,326 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:30:59,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2119359345, now seen corresponding path program 12 times [2018-04-11 15:30:59,326 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:59,326 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:59,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:59,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:59,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:59,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:59,575 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:30:59,575 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:59,575 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:59,576 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:30:59,606 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-11 15:30:59,606 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:59,611 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:59,875 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:30:59,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:59,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2018-04-11 15:30:59,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 15:30:59,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 15:30:59,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=631, Invalid=1091, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 15:30:59,876 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 42 states. [2018-04-11 15:31:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:00,006 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2018-04-11 15:31:00,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:31:00,006 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 166 [2018-04-11 15:31:00,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:00,007 INFO L225 Difference]: With dead ends: 179 [2018-04-11 15:31:00,007 INFO L226 Difference]: Without dead ends: 179 [2018-04-11 15:31:00,007 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=672, Invalid=1134, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 15:31:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-11 15:31:00,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2018-04-11 15:31:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-11 15:31:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-04-11 15:31:00,009 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 166 [2018-04-11 15:31:00,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:00,009 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-04-11 15:31:00,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 15:31:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-04-11 15:31:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-04-11 15:31:00,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:00,010 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] [2018-04-11 15:31:00,010 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:00,010 INFO L82 PathProgramCache]: Analyzing trace with hash 912477073, now seen corresponding path program 13 times [2018-04-11 15:31:00,010 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:00,010 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:00,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:00,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:00,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:00,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:00,263 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:31:00,263 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:00,263 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:00,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:31:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:00,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:00,488 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:31:00,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:00,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2018-04-11 15:31:00,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 15:31:00,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 15:31:00,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=1198, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:31:00,490 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 44 states. [2018-04-11 15:31:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:00,644 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2018-04-11 15:31:00,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:31:00,644 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 174 [2018-04-11 15:31:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:00,645 INFO L225 Difference]: With dead ends: 187 [2018-04-11 15:31:00,645 INFO L226 Difference]: Without dead ends: 187 [2018-04-11 15:31:00,645 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 154 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:31:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-11 15:31:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-04-11 15:31:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-11 15:31:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-04-11 15:31:00,647 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 174 [2018-04-11 15:31:00,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:00,647 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-04-11 15:31:00,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 15:31:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-04-11 15:31:00,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-04-11 15:31:00,648 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:00,648 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] [2018-04-11 15:31:00,648 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:00,648 INFO L82 PathProgramCache]: Analyzing trace with hash -130411855, now seen corresponding path program 14 times [2018-04-11 15:31:00,648 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:00,648 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:00,649 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:00,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:31:00,649 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:00,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:00,931 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:31:00,931 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:00,931 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:00,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:31:00,957 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:31:00,957 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:00,961 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:01,009 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:31:01,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:01,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 26 [2018-04-11 15:31:01,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:31:01,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:31:01,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:31:01,011 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 26 states. [2018-04-11 15:31:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:01,306 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2018-04-11 15:31:01,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:31:01,307 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 182 [2018-04-11 15:31:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:01,307 INFO L225 Difference]: With dead ends: 195 [2018-04-11 15:31:01,308 INFO L226 Difference]: Without dead ends: 195 [2018-04-11 15:31:01,308 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 203 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:31:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-11 15:31:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2018-04-11 15:31:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 15:31:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-04-11 15:31:01,312 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 182 [2018-04-11 15:31:01,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:01,312 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-04-11 15:31:01,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:31:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-04-11 15:31:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-04-11 15:31:01,313 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:01,313 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] [2018-04-11 15:31:01,313 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:01,313 INFO L82 PathProgramCache]: Analyzing trace with hash -662916911, now seen corresponding path program 15 times [2018-04-11 15:31:01,313 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:01,314 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:01,314 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:01,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:01,314 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:01,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:01,941 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:31:01,941 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:01,941 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:01,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:31:01,985 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-11 15:31:01,985 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:01,992 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:02,023 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:31:02,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:02,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 27 [2018-04-11 15:31:02,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 15:31:02,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 15:31:02,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:31:02,024 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 27 states. [2018-04-11 15:31:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:02,368 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2018-04-11 15:31:02,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:31:02,369 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 190 [2018-04-11 15:31:02,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:02,369 INFO L225 Difference]: With dead ends: 203 [2018-04-11 15:31:02,369 INFO L226 Difference]: Without dead ends: 203 [2018-04-11 15:31:02,370 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=855, Invalid=1497, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:31:02,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-11 15:31:02,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2018-04-11 15:31:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-11 15:31:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-04-11 15:31:02,374 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 190 [2018-04-11 15:31:02,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:02,374 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-04-11 15:31:02,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 15:31:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-04-11 15:31:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-04-11 15:31:02,375 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:02,375 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] [2018-04-11 15:31:02,375 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:02,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1678812657, now seen corresponding path program 16 times [2018-04-11 15:31:02,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:02,376 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:02,376 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:02,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:02,376 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:02,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:02,660 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:31:02,661 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:02,661 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:02,661 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:31:02,687 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:31:02,687 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:02,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:02,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:31:02,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:31:02,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:31:02,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:31:03,870 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:31:03,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:03,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 50] total 75 [2018-04-11 15:31:03,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-11 15:31:03,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-11 15:31:03,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=4300, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 15:31:03,872 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 75 states. [2018-04-11 15:31:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:04,484 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2018-04-11 15:31:04,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:31:04,484 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 198 [2018-04-11 15:31:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:04,485 INFO L225 Difference]: With dead ends: 211 [2018-04-11 15:31:04,485 INFO L226 Difference]: Without dead ends: 211 [2018-04-11 15:31:04,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3837 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2185, Invalid=7915, Unknown=0, NotChecked=0, Total=10100 [2018-04-11 15:31:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-11 15:31:04,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2018-04-11 15:31:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-11 15:31:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-04-11 15:31:04,489 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 198 [2018-04-11 15:31:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:04,489 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-04-11 15:31:04,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-11 15:31:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-04-11 15:31:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-04-11 15:31:04,490 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:04,490 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] [2018-04-11 15:31:04,490 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:04,490 INFO L82 PathProgramCache]: Analyzing trace with hash -2145684975, now seen corresponding path program 17 times [2018-04-11 15:31:04,490 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:04,490 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:04,491 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:04,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:04,491 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:04,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:04,774 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:31:04,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:04,774 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:04,775 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:31:04,805 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-04-11 15:31:04,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:04,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:04,830 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:31:04,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:04,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 29 [2018-04-11 15:31:04,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:31:04,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:31:04,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:31:04,832 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 29 states. [2018-04-11 15:31:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:05,310 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2018-04-11 15:31:05,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:31:05,310 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 206 [2018-04-11 15:31:05,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:05,311 INFO L225 Difference]: With dead ends: 219 [2018-04-11 15:31:05,311 INFO L226 Difference]: Without dead ends: 219 [2018-04-11 15:31:05,311 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 230 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:31:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-11 15:31:05,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2018-04-11 15:31:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-11 15:31:05,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-04-11 15:31:05,313 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 206 [2018-04-11 15:31:05,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:05,313 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-04-11 15:31:05,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:31:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-04-11 15:31:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-04-11 15:31:05,314 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:05,314 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] [2018-04-11 15:31:05,314 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:05,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1241683249, now seen corresponding path program 18 times [2018-04-11 15:31:05,314 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:05,314 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:05,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:05,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:05,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:05,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:31:05,679 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:31:05,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:05,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:05,680 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:31:05,717 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-04-11 15:31:05,717 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:05,722 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:05,773 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:31:05,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:05,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 31 [2018-04-11 15:31:05,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:31:05,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:31:05,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=546, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:31:05,775 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 31 states. [2018-04-11 15:31:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:06,318 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2018-04-11 15:31:06,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:31:06,318 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 214 [2018-04-11 15:31:06,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:06,319 INFO L225 Difference]: With dead ends: 227 [2018-04-11 15:31:06,319 INFO L226 Difference]: Without dead ends: 227 [2018-04-11 15:31:06,320 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1089, Invalid=2103, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 15:31:06,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-11 15:31:06,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2018-04-11 15:31:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-11 15:31:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-04-11 15:31:06,324 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 214 [2018-04-11 15:31:06,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:06,324 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-04-11 15:31:06,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:31:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-04-11 15:31:06,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-04-11 15:31:06,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:06,325 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] [2018-04-11 15:31:06,325 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:06,326 INFO L82 PathProgramCache]: Analyzing trace with hash -143945903, now seen corresponding path program 19 times [2018-04-11 15:31:06,326 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:06,326 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:06,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:06,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:06,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:06,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:06,766 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:31:06,766 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:06,766 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:06,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:31:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:06,788 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:07,061 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:31:07,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:07,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 56 [2018-04-11 15:31:07,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-11 15:31:07,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-11 15:31:07,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=1945, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 15:31:07,062 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 56 states. [2018-04-11 15:31:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:07,345 INFO L93 Difference]: Finished difference Result 235 states and 236 transitions. [2018-04-11 15:31:07,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:31:07,346 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 222 [2018-04-11 15:31:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:07,346 INFO L225 Difference]: With dead ends: 235 [2018-04-11 15:31:07,347 INFO L226 Difference]: Without dead ends: 235 [2018-04-11 15:31:07,347 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 196 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:31:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-04-11 15:31:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2018-04-11 15:31:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-04-11 15:31:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-04-11 15:31:07,350 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 222 [2018-04-11 15:31:07,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:07,351 INFO L459 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-04-11 15:31:07,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-11 15:31:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-04-11 15:31:07,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-04-11 15:31:07,352 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:07,352 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] [2018-04-11 15:31:07,352 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:07,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1237589903, now seen corresponding path program 20 times [2018-04-11 15:31:07,352 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:07,352 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:07,353 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:07,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:31:07,353 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:07,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:31:07,831 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:31:07,831 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:07,831 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:07,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:31:07,859 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:31:07,859 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:07,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:07,933 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:31:07,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:07,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 32 [2018-04-11 15:31:07,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 15:31:07,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 15:31:07,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=553, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:31:07,934 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 32 states. [2018-04-11 15:31:08,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:08,432 INFO L93 Difference]: Finished difference Result 243 states and 244 transitions. [2018-04-11 15:31:08,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:31:08,432 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 230 [2018-04-11 15:31:08,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:08,433 INFO L225 Difference]: With dead ends: 243 [2018-04-11 15:31:08,433 INFO L226 Difference]: Without dead ends: 243 [2018-04-11 15:31:08,433 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1250, Invalid=2172, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:31:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-11 15:31:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2018-04-11 15:31:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-04-11 15:31:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-04-11 15:31:08,436 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 230 [2018-04-11 15:31:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:08,436 INFO L459 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-04-11 15:31:08,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 15:31:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-04-11 15:31:08,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-04-11 15:31:08,437 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:08,437 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] [2018-04-11 15:31:08,437 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:08,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1936127855, now seen corresponding path program 21 times [2018-04-11 15:31:08,438 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:08,438 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:08,438 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:08,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:08,439 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:08,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:08,912 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:31:08,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:08,912 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:08,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:31:08,948 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-04-11 15:31:08,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:08,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:09,497 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:31:09,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:09,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 60 [2018-04-11 15:31:09,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-11 15:31:09,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-11 15:31:09,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1306, Invalid=2234, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 15:31:09,498 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 60 states. [2018-04-11 15:31:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:09,695 INFO L93 Difference]: Finished difference Result 251 states and 252 transitions. [2018-04-11 15:31:09,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:31:09,695 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 238 [2018-04-11 15:31:09,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:09,696 INFO L225 Difference]: With dead ends: 251 [2018-04-11 15:31:09,696 INFO L226 Difference]: Without dead ends: 251 [2018-04-11 15:31:09,696 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1365, Invalid=2295, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 15:31:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-11 15:31:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2018-04-11 15:31:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-04-11 15:31:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-04-11 15:31:09,699 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 238 [2018-04-11 15:31:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:09,699 INFO L459 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-04-11 15:31:09,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-11 15:31:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-04-11 15:31:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-04-11 15:31:09,700 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:09,701 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] [2018-04-11 15:31:09,701 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:09,701 INFO L82 PathProgramCache]: Analyzing trace with hash 954763185, now seen corresponding path program 22 times [2018-04-11 15:31:09,701 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:09,701 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:09,702 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:09,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:09,702 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:09,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:10,069 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:31:10,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:10,069 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:10,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:31:10,101 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:31:10,101 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:10,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:10,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:31:10,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:31:10,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:31:10,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:31:11,535 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:31:11,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:11,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 62] total 93 [2018-04-11 15:31:11,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-11 15:31:11,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-11 15:31:11,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1922, Invalid=6634, Unknown=0, NotChecked=0, Total=8556 [2018-04-11 15:31:11,536 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 93 states. [2018-04-11 15:31:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:12,244 INFO L93 Difference]: Finished difference Result 259 states and 260 transitions. [2018-04-11 15:31:12,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 15:31:12,244 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 246 [2018-04-11 15:31:12,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:12,245 INFO L225 Difference]: With dead ends: 259 [2018-04-11 15:31:12,245 INFO L226 Difference]: Without dead ends: 259 [2018-04-11 15:31:12,246 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6057 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3358, Invalid=12142, Unknown=0, NotChecked=0, Total=15500 [2018-04-11 15:31:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-11 15:31:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2018-04-11 15:31:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-11 15:31:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-04-11 15:31:12,248 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 246 [2018-04-11 15:31:12,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:12,248 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-04-11 15:31:12,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-11 15:31:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-04-11 15:31:12,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-04-11 15:31:12,249 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:12,249 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] [2018-04-11 15:31:12,249 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash 298835409, now seen corresponding path program 23 times [2018-04-11 15:31:12,249 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:12,249 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:12,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:12,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:12,250 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:12,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:12,674 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:31:12,674 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:12,674 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:12,674 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:31:12,709 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-04-11 15:31:12,709 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:12,713 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:12,744 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:31:12,745 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:12,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 35 [2018-04-11 15:31:12,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 15:31:12,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 15:31:12,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=658, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:31:12,746 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 35 states. [2018-04-11 15:31:13,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:13,161 INFO L93 Difference]: Finished difference Result 267 states and 268 transitions. [2018-04-11 15:31:13,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 15:31:13,161 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 254 [2018-04-11 15:31:13,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:13,162 INFO L225 Difference]: With dead ends: 267 [2018-04-11 15:31:13,162 INFO L226 Difference]: Without dead ends: 267 [2018-04-11 15:31:13,162 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 284 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:31:13,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-04-11 15:31:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2018-04-11 15:31:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-11 15:31:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-04-11 15:31:13,164 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 254 [2018-04-11 15:31:13,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:13,164 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-04-11 15:31:13,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 15:31:13,164 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-04-11 15:31:13,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-04-11 15:31:13,165 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:13,165 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] [2018-04-11 15:31:13,165 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:13,166 INFO L82 PathProgramCache]: Analyzing trace with hash -432764175, now seen corresponding path program 24 times [2018-04-11 15:31:13,166 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:13,166 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:13,166 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:13,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:13,166 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:13,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:13,663 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:31:13,663 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:13,663 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:13,663 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:31:13,709 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-04-11 15:31:13,709 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:13,717 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:14,204 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:31:14,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:14,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 66 [2018-04-11 15:31:14,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-11 15:31:14,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-11 15:31:14,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1585, Invalid=2705, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 15:31:14,206 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 66 states. [2018-04-11 15:31:14,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:14,463 INFO L93 Difference]: Finished difference Result 275 states and 276 transitions. [2018-04-11 15:31:14,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 15:31:14,464 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 262 [2018-04-11 15:31:14,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:14,464 INFO L225 Difference]: With dead ends: 275 [2018-04-11 15:31:14,465 INFO L226 Difference]: Without dead ends: 275 [2018-04-11 15:31:14,465 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 231 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:31:14,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-11 15:31:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2018-04-11 15:31:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-11 15:31:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-04-11 15:31:14,467 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 262 [2018-04-11 15:31:14,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:14,467 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-04-11 15:31:14,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-11 15:31:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-04-11 15:31:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-04-11 15:31:14,468 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:14,468 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] [2018-04-11 15:31:14,468 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:14,468 INFO L82 PathProgramCache]: Analyzing trace with hash -583266543, now seen corresponding path program 25 times [2018-04-11 15:31:14,468 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:14,468 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:14,469 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:14,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:14,469 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:14,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:14,877 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:31:14,877 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:14,904 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:14,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:31:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:14,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:15,361 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:31:15,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:15,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 68 [2018-04-11 15:31:15,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-11 15:31:15,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-11 15:31:15,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1684, Invalid=2872, Unknown=0, NotChecked=0, Total=4556 [2018-04-11 15:31:15,363 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 68 states. [2018-04-11 15:31:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:15,607 INFO L93 Difference]: Finished difference Result 283 states and 284 transitions. [2018-04-11 15:31:15,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 15:31:15,607 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 270 [2018-04-11 15:31:15,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:15,608 INFO L225 Difference]: With dead ends: 283 [2018-04-11 15:31:15,608 INFO L226 Difference]: Without dead ends: 283 [2018-04-11 15:31:15,608 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2013 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1751, Invalid=2941, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 15:31:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-11 15:31:15,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2018-04-11 15:31:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-04-11 15:31:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-04-11 15:31:15,610 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 270 [2018-04-11 15:31:15,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:15,610 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-04-11 15:31:15,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-11 15:31:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-04-11 15:31:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-04-11 15:31:15,611 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:15,611 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] [2018-04-11 15:31:15,611 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:15,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1447815729, now seen corresponding path program 26 times [2018-04-11 15:31:15,612 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:15,612 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:15,612 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:15,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:31:15,612 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:15,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:16,051 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:31:16,051 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:16,051 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:16,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:31:16,074 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:31:16,074 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:16,078 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:16,130 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:31:16,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:16,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 38 [2018-04-11 15:31:16,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 15:31:16,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 15:31:16,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=772, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:31:16,135 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 38 states. [2018-04-11 15:31:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:16,777 INFO L93 Difference]: Finished difference Result 291 states and 292 transitions. [2018-04-11 15:31:16,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 15:31:16,778 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 278 [2018-04-11 15:31:16,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:16,778 INFO L225 Difference]: With dead ends: 291 [2018-04-11 15:31:16,778 INFO L226 Difference]: Without dead ends: 291 [2018-04-11 15:31:16,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1823, Invalid=3147, Unknown=0, NotChecked=0, Total=4970 [2018-04-11 15:31:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-04-11 15:31:16,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2018-04-11 15:31:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-04-11 15:31:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-04-11 15:31:16,781 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 278 [2018-04-11 15:31:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:16,781 INFO L459 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-04-11 15:31:16,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 15:31:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-04-11 15:31:16,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-04-11 15:31:16,782 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:16,782 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] [2018-04-11 15:31:16,782 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:16,783 INFO L82 PathProgramCache]: Analyzing trace with hash -922117039, now seen corresponding path program 27 times [2018-04-11 15:31:16,783 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:16,783 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:16,783 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:16,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:16,783 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:16,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:17,328 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:31:17,328 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:17,328 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:17,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:31:17,366 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-04-11 15:31:17,366 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:17,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:17,413 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:31:17,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:17,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 39 [2018-04-11 15:31:17,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 15:31:17,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 15:31:17,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=812, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:31:17,414 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 39 states. [2018-04-11 15:31:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:18,004 INFO L93 Difference]: Finished difference Result 299 states and 300 transitions. [2018-04-11 15:31:18,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 15:31:18,004 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 286 [2018-04-11 15:31:18,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:18,005 INFO L225 Difference]: With dead ends: 299 [2018-04-11 15:31:18,005 INFO L226 Difference]: Without dead ends: 299 [2018-04-11 15:31:18,005 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1929, Invalid=3327, Unknown=0, NotChecked=0, Total=5256 [2018-04-11 15:31:18,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-04-11 15:31:18,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2018-04-11 15:31:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-04-11 15:31:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-04-11 15:31:18,008 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 286 [2018-04-11 15:31:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:18,008 INFO L459 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-04-11 15:31:18,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 15:31:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-04-11 15:31:18,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-04-11 15:31:18,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:18,010 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] [2018-04-11 15:31:18,010 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:18,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1520786063, now seen corresponding path program 28 times [2018-04-11 15:31:18,010 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:18,010 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:18,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:18,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:18,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:18,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:18,568 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:31:18,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:18,569 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:18,569 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:31:18,611 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:31:18,611 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:18,623 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:18,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:31:18,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:31:18,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:31:18,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:31:20,649 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:31:20,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:20,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 74] total 111 [2018-04-11 15:31:20,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-04-11 15:31:20,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-04-11 15:31:20,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2738, Invalid=9472, Unknown=0, NotChecked=0, Total=12210 [2018-04-11 15:31:20,650 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 111 states. [2018-04-11 15:31:21,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:21,650 INFO L93 Difference]: Finished difference Result 307 states and 308 transitions. [2018-04-11 15:31:21,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-11 15:31:21,650 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 294 [2018-04-11 15:31:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:21,651 INFO L225 Difference]: With dead ends: 307 [2018-04-11 15:31:21,651 INFO L226 Difference]: Without dead ends: 307 [2018-04-11 15:31:21,652 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8781 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4783, Invalid=17269, Unknown=0, NotChecked=0, Total=22052 [2018-04-11 15:31:21,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-11 15:31:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2018-04-11 15:31:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-04-11 15:31:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-04-11 15:31:21,654 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 294 [2018-04-11 15:31:21,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:21,654 INFO L459 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-04-11 15:31:21,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-04-11 15:31:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-04-11 15:31:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-04-11 15:31:21,655 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:21,655 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] [2018-04-11 15:31:21,655 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:21,655 INFO L82 PathProgramCache]: Analyzing trace with hash 862225809, now seen corresponding path program 29 times [2018-04-11 15:31:21,655 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:21,655 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:21,655 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:21,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:21,655 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:21,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:22,205 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:31:22,206 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:22,206 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:22,206 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:31:22,253 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-04-11 15:31:22,253 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:22,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:22,329 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:31:22,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:22,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38] total 41 [2018-04-11 15:31:22,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 15:31:22,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 15:31:22,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=745, Invalid=895, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:31:22,330 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 41 states. [2018-04-11 15:31:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:23,017 INFO L93 Difference]: Finished difference Result 315 states and 316 transitions. [2018-04-11 15:31:23,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 15:31:23,018 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 302 [2018-04-11 15:31:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:23,018 INFO L225 Difference]: With dead ends: 315 [2018-04-11 15:31:23,019 INFO L226 Difference]: Without dead ends: 315 [2018-04-11 15:31:23,019 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2150, Invalid=3702, Unknown=0, NotChecked=0, Total=5852 [2018-04-11 15:31:23,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-04-11 15:31:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2018-04-11 15:31:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-04-11 15:31:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2018-04-11 15:31:23,023 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 302 [2018-04-11 15:31:23,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:23,023 INFO L459 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2018-04-11 15:31:23,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 15:31:23,023 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2018-04-11 15:31:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-04-11 15:31:23,024 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:23,025 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] [2018-04-11 15:31:23,025 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:23,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1938603185, now seen corresponding path program 30 times [2018-04-11 15:31:23,025 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:23,025 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:23,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:23,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:23,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:23,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:23,574 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:31:23,575 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:23,575 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:23,575 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:31:23,624 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-04-11 15:31:23,624 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:23,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:24,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:31:24,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:24,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40] total 78 [2018-04-11 15:31:24,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-11 15:31:24,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-11 15:31:24,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2224, Invalid=3782, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 15:31:24,354 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 78 states. [2018-04-11 15:31:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:24,644 INFO L93 Difference]: Finished difference Result 323 states and 324 transitions. [2018-04-11 15:31:24,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 15:31:24,645 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 310 [2018-04-11 15:31:24,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:24,645 INFO L225 Difference]: With dead ends: 323 [2018-04-11 15:31:24,645 INFO L226 Difference]: Without dead ends: 323 [2018-04-11 15:31:24,646 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2698 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2301, Invalid=3861, Unknown=0, NotChecked=0, Total=6162 [2018-04-11 15:31:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-11 15:31:24,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2018-04-11 15:31:24,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-04-11 15:31:24,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-04-11 15:31:24,648 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 310 [2018-04-11 15:31:24,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:24,648 INFO L459 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-04-11 15:31:24,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-11 15:31:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-04-11 15:31:24,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-04-11 15:31:24,649 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:24,649 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] [2018-04-11 15:31:24,649 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:24,649 INFO L82 PathProgramCache]: Analyzing trace with hash -25638191, now seen corresponding path program 31 times [2018-04-11 15:31:24,649 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:24,649 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:24,650 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:24,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:24,650 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:24,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:25,218 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:31:25,218 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:25,247 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:25,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:31:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:25,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:25,770 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:31:25,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:25,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 80 [2018-04-11 15:31:25,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-11 15:31:25,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-11 15:31:25,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2341, Invalid=3979, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 15:31:25,772 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 80 states. [2018-04-11 15:31:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:26,119 INFO L93 Difference]: Finished difference Result 331 states and 332 transitions. [2018-04-11 15:31:26,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-11 15:31:26,120 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 318 [2018-04-11 15:31:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:26,121 INFO L225 Difference]: With dead ends: 331 [2018-04-11 15:31:26,121 INFO L226 Difference]: Without dead ends: 331 [2018-04-11 15:31:26,121 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 280 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:31:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-04-11 15:31:26,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2018-04-11 15:31:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-04-11 15:31:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-04-11 15:31:26,125 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 318 [2018-04-11 15:31:26,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:26,125 INFO L459 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-04-11 15:31:26,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-11 15:31:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-04-11 15:31:26,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-04-11 15:31:26,126 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:26,126 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] [2018-04-11 15:31:26,126 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:26,126 INFO L82 PathProgramCache]: Analyzing trace with hash -452055055, now seen corresponding path program 32 times [2018-04-11 15:31:26,126 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:26,126 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:26,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:26,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:31:26,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:26,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:26,817 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:31:26,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:26,818 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:26,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:31:26,844 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:31:26,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:26,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:26,890 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:31:26,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:26,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 41] total 44 [2018-04-11 15:31:26,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 15:31:26,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 15:31:26,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=1027, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:31:26,891 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 44 states. [2018-04-11 15:31:27,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:27,552 INFO L93 Difference]: Finished difference Result 339 states and 340 transitions. [2018-04-11 15:31:27,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-11 15:31:27,552 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 326 [2018-04-11 15:31:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:27,553 INFO L225 Difference]: With dead ends: 339 [2018-04-11 15:31:27,553 INFO L226 Difference]: Without dead ends: 339 [2018-04-11 15:31:27,553 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2504, Invalid=4302, Unknown=0, NotChecked=0, Total=6806 [2018-04-11 15:31:27,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-04-11 15:31:27,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2018-04-11 15:31:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-04-11 15:31:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2018-04-11 15:31:27,556 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 326 [2018-04-11 15:31:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:27,556 INFO L459 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2018-04-11 15:31:27,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 15:31:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2018-04-11 15:31:27,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-04-11 15:31:27,557 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:27,557 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] [2018-04-11 15:31:27,557 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:27,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1871549423, now seen corresponding path program 33 times [2018-04-11 15:31:27,557 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:27,557 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:27,558 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:27,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:27,558 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:27,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:28,390 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:31:28,390 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:28,390 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:28,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:31:28,444 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-04-11 15:31:28,444 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:28,454 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:29,024 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:31:29,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:29,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 84 [2018-04-11 15:31:29,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-11 15:31:29,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-11 15:31:29,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2584, Invalid=4388, Unknown=0, NotChecked=0, Total=6972 [2018-04-11 15:31:29,026 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 84 states. [2018-04-11 15:31:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:29,357 INFO L93 Difference]: Finished difference Result 347 states and 348 transitions. [2018-04-11 15:31:29,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-11 15:31:29,357 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 334 [2018-04-11 15:31:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:29,358 INFO L225 Difference]: With dead ends: 347 [2018-04-11 15:31:29,358 INFO L226 Difference]: Without dead ends: 347 [2018-04-11 15:31:29,359 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 294 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:31:29,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-04-11 15:31:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2018-04-11 15:31:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-04-11 15:31:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-04-11 15:31:29,362 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 334 [2018-04-11 15:31:29,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:29,362 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-04-11 15:31:29,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-11 15:31:29,362 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-04-11 15:31:29,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-04-11 15:31:29,363 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:29,363 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] [2018-04-11 15:31:29,363 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:29,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1576337615, now seen corresponding path program 34 times [2018-04-11 15:31:29,363 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:29,363 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:29,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:29,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:29,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:29,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:30,087 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:31:30,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:30,087 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:30,088 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:31:30,139 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:31:30,140 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:30,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:30,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:31:30,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:31:30,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:31:30,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:31:32,486 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:31:32,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:32,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 86] total 129 [2018-04-11 15:31:32,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-04-11 15:31:32,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-04-11 15:31:32,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3698, Invalid=12814, Unknown=0, NotChecked=0, Total=16512 [2018-04-11 15:31:32,489 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 129 states. [2018-04-11 15:31:33,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:33,896 INFO L93 Difference]: Finished difference Result 355 states and 356 transitions. [2018-04-11 15:31:33,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-11 15:31:33,896 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 342 [2018-04-11 15:31:33,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:33,897 INFO L225 Difference]: With dead ends: 355 [2018-04-11 15:31:33,897 INFO L226 Difference]: Without dead ends: 355 [2018-04-11 15:31:33,898 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12009 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=6460, Invalid=23296, Unknown=0, NotChecked=0, Total=29756 [2018-04-11 15:31:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-04-11 15:31:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2018-04-11 15:31:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-04-11 15:31:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-04-11 15:31:33,900 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 342 [2018-04-11 15:31:33,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:33,900 INFO L459 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-04-11 15:31:33,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-04-11 15:31:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-04-11 15:31:33,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-04-11 15:31:33,902 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:33,902 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] [2018-04-11 15:31:33,902 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:33,902 INFO L82 PathProgramCache]: Analyzing trace with hash -746755759, now seen corresponding path program 35 times [2018-04-11 15:31:33,902 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:33,902 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:33,903 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:33,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:33,903 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:33,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:34,617 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:31:34,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:34,617 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:34,617 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:31:34,700 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-04-11 15:31:34,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:34,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:34,762 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:31:34,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:34,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44] total 47 [2018-04-11 15:31:34,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-11 15:31:34,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-11 15:31:34,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=1168, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 15:31:34,763 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 47 states. [2018-04-11 15:31:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:35,466 INFO L93 Difference]: Finished difference Result 363 states and 364 transitions. [2018-04-11 15:31:35,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 15:31:35,466 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 350 [2018-04-11 15:31:35,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:35,467 INFO L225 Difference]: With dead ends: 363 [2018-04-11 15:31:35,467 INFO L226 Difference]: Without dead ends: 363 [2018-04-11 15:31:35,468 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 392 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:31:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-04-11 15:31:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2018-04-11 15:31:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-04-11 15:31:35,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-04-11 15:31:35,470 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 350 [2018-04-11 15:31:35,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:35,471 INFO L459 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-04-11 15:31:35,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-11 15:31:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-04-11 15:31:35,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-04-11 15:31:35,472 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:35,472 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] [2018-04-11 15:31:35,473 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:35,473 INFO L82 PathProgramCache]: Analyzing trace with hash -693163407, now seen corresponding path program 36 times [2018-04-11 15:31:35,473 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:35,473 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:35,473 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:35,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:35,474 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:35,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:36,305 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:31:36,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:36,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:36,306 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:31:36,392 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-04-11 15:31:36,392 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:36,414 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:37,038 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:31:37,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:37,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46] total 90 [2018-04-11 15:31:37,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-11 15:31:37,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-11 15:31:37,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2971, Invalid=5039, Unknown=0, NotChecked=0, Total=8010 [2018-04-11 15:31:37,040 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 90 states. [2018-04-11 15:31:37,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:37,451 INFO L93 Difference]: Finished difference Result 371 states and 372 transitions. [2018-04-11 15:31:37,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-11 15:31:37,451 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 358 [2018-04-11 15:31:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:37,452 INFO L225 Difference]: With dead ends: 371 [2018-04-11 15:31:37,452 INFO L226 Difference]: Without dead ends: 371 [2018-04-11 15:31:37,453 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3652 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3060, Invalid=5130, Unknown=0, NotChecked=0, Total=8190 [2018-04-11 15:31:37,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-04-11 15:31:37,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2018-04-11 15:31:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-04-11 15:31:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2018-04-11 15:31:37,456 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 358 [2018-04-11 15:31:37,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:37,456 INFO L459 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2018-04-11 15:31:37,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-11 15:31:37,456 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2018-04-11 15:31:37,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-04-11 15:31:37,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:37,457 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] [2018-04-11 15:31:37,458 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:37,458 INFO L82 PathProgramCache]: Analyzing trace with hash 902152849, now seen corresponding path program 37 times [2018-04-11 15:31:37,458 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:37,458 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:37,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:37,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:37,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:37,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:38,252 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:31:38,252 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:38,252 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:38,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:31:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:38,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:38,908 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:31:38,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:38,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47] total 92 [2018-04-11 15:31:38,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-11 15:31:38,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-11 15:31:38,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3106, Invalid=5266, Unknown=0, NotChecked=0, Total=8372 [2018-04-11 15:31:38,909 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 92 states. [2018-04-11 15:31:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:39,304 INFO L93 Difference]: Finished difference Result 379 states and 380 transitions. [2018-04-11 15:31:39,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-11 15:31:39,305 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 366 [2018-04-11 15:31:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:39,305 INFO L225 Difference]: With dead ends: 379 [2018-04-11 15:31:39,306 INFO L226 Difference]: Without dead ends: 379 [2018-04-11 15:31:39,306 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 322 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3825 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3197, Invalid=5359, Unknown=0, NotChecked=0, Total=8556 [2018-04-11 15:31:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-11 15:31:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 375. [2018-04-11 15:31:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-04-11 15:31:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2018-04-11 15:31:39,308 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 366 [2018-04-11 15:31:39,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:39,309 INFO L459 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2018-04-11 15:31:39,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-11 15:31:39,309 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2018-04-11 15:31:39,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-04-11 15:31:39,310 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:39,310 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] [2018-04-11 15:31:39,310 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:39,310 INFO L82 PathProgramCache]: Analyzing trace with hash 858173873, now seen corresponding path program 38 times [2018-04-11 15:31:39,310 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:39,310 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:39,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:39,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:31:39,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:39,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:40,154 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:31:40,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:40,154 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:40,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:31:40,184 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:31:40,184 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:40,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:40,240 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:31:40,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:40,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 47] total 50 [2018-04-11 15:31:40,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-11 15:31:40,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-11 15:31:40,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=1318, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 15:31:40,241 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 50 states. [2018-04-11 15:31:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:40,952 INFO L93 Difference]: Finished difference Result 387 states and 388 transitions. [2018-04-11 15:31:40,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-11 15:31:40,952 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 374 [2018-04-11 15:31:40,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:40,953 INFO L225 Difference]: With dead ends: 387 [2018-04-11 15:31:40,953 INFO L226 Difference]: Without dead ends: 387 [2018-04-11 15:31:40,953 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 419 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:31:40,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-04-11 15:31:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2018-04-11 15:31:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-04-11 15:31:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2018-04-11 15:31:40,955 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 374 [2018-04-11 15:31:40,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:40,955 INFO L459 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2018-04-11 15:31:40,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-11 15:31:40,956 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2018-04-11 15:31:40,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-04-11 15:31:40,956 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:40,957 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] [2018-04-11 15:31:40,957 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:40,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1451788335, now seen corresponding path program 39 times [2018-04-11 15:31:40,957 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:40,957 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:40,957 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:40,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:40,957 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:40,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:41,815 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:31:41,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:41,815 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:41,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:31:41,871 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-04-11 15:31:41,871 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:41,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:41,936 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:31:41,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:41,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 48] total 51 [2018-04-11 15:31:41,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-11 15:31:41,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-11 15:31:41,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1180, Invalid=1370, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 15:31:41,937 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 51 states. [2018-04-11 15:31:42,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:42,723 INFO L93 Difference]: Finished difference Result 395 states and 396 transitions. [2018-04-11 15:31:42,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 15:31:42,723 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 382 [2018-04-11 15:31:42,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:42,724 INFO L225 Difference]: With dead ends: 395 [2018-04-11 15:31:42,724 INFO L226 Difference]: Without dead ends: 395 [2018-04-11 15:31:42,725 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3435, Invalid=5877, Unknown=0, NotChecked=0, Total=9312 [2018-04-11 15:31:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-04-11 15:31:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2018-04-11 15:31:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-04-11 15:31:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2018-04-11 15:31:42,727 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 382 [2018-04-11 15:31:42,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:42,727 INFO L459 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2018-04-11 15:31:42,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-11 15:31:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2018-04-11 15:31:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-04-11 15:31:42,728 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:42,728 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] [2018-04-11 15:31:42,728 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:42,728 INFO L82 PathProgramCache]: Analyzing trace with hash -341994255, now seen corresponding path program 40 times [2018-04-11 15:31:42,728 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:42,729 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:42,729 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:42,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:42,729 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:42,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:43,611 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:31:43,611 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:43,611 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:43,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:31:43,682 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:31:43,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:43,695 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:43,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:31:43,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:31:43,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:31:43,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:31:46,652 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:31:46,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:46,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 98] total 147 [2018-04-11 15:31:46,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-04-11 15:31:46,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-04-11 15:31:46,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4802, Invalid=16660, Unknown=0, NotChecked=0, Total=21462 [2018-04-11 15:31:46,653 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 147 states. [2018-04-11 15:31:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:48,189 INFO L93 Difference]: Finished difference Result 403 states and 404 transitions. [2018-04-11 15:31:48,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-11 15:31:48,189 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 390 [2018-04-11 15:31:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:48,190 INFO L225 Difference]: With dead ends: 403 [2018-04-11 15:31:48,190 INFO L226 Difference]: Without dead ends: 403 [2018-04-11 15:31:48,191 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 295 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:31:48,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-04-11 15:31:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 399. [2018-04-11 15:31:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-04-11 15:31:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2018-04-11 15:31:48,195 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 390 [2018-04-11 15:31:48,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:48,195 INFO L459 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2018-04-11 15:31:48,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-04-11 15:31:48,195 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2018-04-11 15:31:48,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-04-11 15:31:48,197 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:48,197 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] [2018-04-11 15:31:48,197 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:48,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1531016943, now seen corresponding path program 41 times [2018-04-11 15:31:48,198 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:48,198 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:48,198 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:48,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:48,199 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:48,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:49,121 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:31:49,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:49,122 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:49,122 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:31:49,182 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-04-11 15:31:49,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:49,188 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:49,245 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:31:49,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:49,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 50] total 53 [2018-04-11 15:31:49,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-11 15:31:49,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-11 15:31:49,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=1477, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 15:31:49,246 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 53 states. [2018-04-11 15:31:50,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:50,109 INFO L93 Difference]: Finished difference Result 411 states and 412 transitions. [2018-04-11 15:31:50,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-11 15:31:50,109 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 398 [2018-04-11 15:31:50,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:50,110 INFO L225 Difference]: With dead ends: 411 [2018-04-11 15:31:50,110 INFO L226 Difference]: Without dead ends: 411 [2018-04-11 15:31:50,110 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 446 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:31:50,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-04-11 15:31:50,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2018-04-11 15:31:50,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-04-11 15:31:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2018-04-11 15:31:50,112 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 398 [2018-04-11 15:31:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:50,113 INFO L459 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2018-04-11 15:31:50,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-11 15:31:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2018-04-11 15:31:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-04-11 15:31:50,114 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:50,114 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] [2018-04-11 15:31:50,114 INFO L408 AbstractCegarLoop]: === Iteration 54 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:50,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1203776463, now seen corresponding path program 42 times [2018-04-11 15:31:50,114 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:50,114 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:50,114 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:50,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:50,115 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:50,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:51,094 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:31:51,094 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:51,094 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:51,095 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:31:51,184 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-04-11 15:31:51,184 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:51,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:51,272 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:31:51,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:51,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52] total 55 [2018-04-11 15:31:51,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-11 15:31:51,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-11 15:31:51,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1332, Invalid=1638, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 15:31:51,274 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 55 states. [2018-04-11 15:31:52,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:52,199 INFO L93 Difference]: Finished difference Result 419 states and 420 transitions. [2018-04-11 15:31:52,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-11 15:31:52,199 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 406 [2018-04-11 15:31:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:52,200 INFO L225 Difference]: With dead ends: 419 [2018-04-11 15:31:52,200 INFO L226 Difference]: Without dead ends: 419 [2018-04-11 15:31:52,200 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3885, Invalid=7035, Unknown=0, NotChecked=0, Total=10920 [2018-04-11 15:31:52,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-04-11 15:31:52,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2018-04-11 15:31:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-04-11 15:31:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2018-04-11 15:31:52,203 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 406 [2018-04-11 15:31:52,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:52,203 INFO L459 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2018-04-11 15:31:52,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-11 15:31:52,203 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2018-04-11 15:31:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-04-11 15:31:52,205 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:52,205 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] [2018-04-11 15:31:52,205 INFO L408 AbstractCegarLoop]: === Iteration 55 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:52,205 INFO L82 PathProgramCache]: Analyzing trace with hash 566687313, now seen corresponding path program 43 times [2018-04-11 15:31:52,205 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:52,205 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:52,206 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:52,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:52,206 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:52,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:53,236 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:31:53,236 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:53,250 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:53,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:31:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:53,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:54,080 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:31:54,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:54,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53] total 104 [2018-04-11 15:31:54,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-04-11 15:31:54,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-04-11 15:31:54,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3979, Invalid=6733, Unknown=0, NotChecked=0, Total=10712 [2018-04-11 15:31:54,082 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 104 states. [2018-04-11 15:31:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:54,651 INFO L93 Difference]: Finished difference Result 427 states and 428 transitions. [2018-04-11 15:31:54,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-11 15:31:54,651 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 414 [2018-04-11 15:31:54,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:54,652 INFO L225 Difference]: With dead ends: 427 [2018-04-11 15:31:54,652 INFO L226 Difference]: Without dead ends: 427 [2018-04-11 15:31:54,652 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 364 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:31:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-04-11 15:31:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2018-04-11 15:31:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-04-11 15:31:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 424 transitions. [2018-04-11 15:31:54,654 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 424 transitions. Word has length 414 [2018-04-11 15:31:54,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:54,654 INFO L459 AbstractCegarLoop]: Abstraction has 423 states and 424 transitions. [2018-04-11 15:31:54,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-04-11 15:31:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 424 transitions. [2018-04-11 15:31:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-04-11 15:31:54,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:54,656 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] [2018-04-11 15:31:54,656 INFO L408 AbstractCegarLoop]: === Iteration 56 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:54,656 INFO L82 PathProgramCache]: Analyzing trace with hash -717656207, now seen corresponding path program 44 times [2018-04-11 15:31:54,656 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:54,656 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:54,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:54,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:31:54,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:54,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:55,688 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:31:55,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:55,688 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:55,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:31:55,724 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:31:55,725 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:55,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:55,791 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:31:55,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:55,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 53] total 56 [2018-04-11 15:31:55,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-11 15:31:55,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-11 15:31:55,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1435, Invalid=1645, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 15:31:55,792 INFO L87 Difference]: Start difference. First operand 423 states and 424 transitions. Second operand 56 states. [2018-04-11 15:31:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:56,778 INFO L93 Difference]: Finished difference Result 435 states and 436 transitions. [2018-04-11 15:31:56,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-11 15:31:56,778 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 422 [2018-04-11 15:31:56,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:56,779 INFO L225 Difference]: With dead ends: 435 [2018-04-11 15:31:56,779 INFO L226 Difference]: Without dead ends: 435 [2018-04-11 15:31:56,780 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=4190, Invalid=7152, Unknown=0, NotChecked=0, Total=11342 [2018-04-11 15:31:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-04-11 15:31:56,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2018-04-11 15:31:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-04-11 15:31:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2018-04-11 15:31:56,782 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 422 [2018-04-11 15:31:56,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:56,783 INFO L459 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2018-04-11 15:31:56,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-11 15:31:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2018-04-11 15:31:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-04-11 15:31:56,784 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:56,784 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] [2018-04-11 15:31:56,784 INFO L408 AbstractCegarLoop]: === Iteration 57 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:56,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1631797359, now seen corresponding path program 45 times [2018-04-11 15:31:56,784 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:56,784 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:56,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:56,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:56,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:56,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:31:57,877 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:31:57,877 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:31:57,877 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:31:57,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:31:57,947 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-04-11 15:31:57,947 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:31:57,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:31:58,864 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:31:58,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:31:58,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 108 [2018-04-11 15:31:58,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-04-11 15:31:58,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-04-11 15:31:58,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4294, Invalid=7262, Unknown=0, NotChecked=0, Total=11556 [2018-04-11 15:31:58,866 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 108 states. [2018-04-11 15:31:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:31:59,401 INFO L93 Difference]: Finished difference Result 443 states and 444 transitions. [2018-04-11 15:31:59,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-11 15:31:59,402 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 430 [2018-04-11 15:31:59,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:31:59,402 INFO L225 Difference]: With dead ends: 443 [2018-04-11 15:31:59,403 INFO L226 Difference]: Without dead ends: 443 [2018-04-11 15:31:59,403 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5353 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4401, Invalid=7371, Unknown=0, NotChecked=0, Total=11772 [2018-04-11 15:31:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-04-11 15:31:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2018-04-11 15:31:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-04-11 15:31:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2018-04-11 15:31:59,405 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 430 [2018-04-11 15:31:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:31:59,405 INFO L459 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2018-04-11 15:31:59,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-04-11 15:31:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2018-04-11 15:31:59,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-04-11 15:31:59,407 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:31:59,407 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] [2018-04-11 15:31:59,407 INFO L408 AbstractCegarLoop]: === Iteration 58 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:31:59,407 INFO L82 PathProgramCache]: Analyzing trace with hash 45508273, now seen corresponding path program 46 times [2018-04-11 15:31:59,407 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:31:59,407 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:31:59,408 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:59,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:31:59,408 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:31:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:31:59,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:32:00,552 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:32:00,552 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:32:00,552 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:32:00,553 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:32:00,648 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:32:00,648 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:32:00,665 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:32:00,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:32:00,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:32:00,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:32:00,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:32:04,589 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:32:04,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:32:04,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 110] total 165 [2018-04-11 15:32:04,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-04-11 15:32:04,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-04-11 15:32:04,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6050, Invalid=21010, Unknown=0, NotChecked=0, Total=27060 [2018-04-11 15:32:04,591 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 165 states. [2018-04-11 15:32:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:32:06,465 INFO L93 Difference]: Finished difference Result 451 states and 452 transitions. [2018-04-11 15:32:06,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-11 15:32:06,465 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 438 [2018-04-11 15:32:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:32:06,466 INFO L225 Difference]: With dead ends: 451 [2018-04-11 15:32:06,466 INFO L226 Difference]: Without dead ends: 451 [2018-04-11 15:32:06,467 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19977 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=10570, Invalid=38050, Unknown=0, NotChecked=0, Total=48620 [2018-04-11 15:32:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-04-11 15:32:06,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2018-04-11 15:32:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-04-11 15:32:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 448 transitions. [2018-04-11 15:32:06,469 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 448 transitions. Word has length 438 [2018-04-11 15:32:06,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:32:06,469 INFO L459 AbstractCegarLoop]: Abstraction has 447 states and 448 transitions. [2018-04-11 15:32:06,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-04-11 15:32:06,469 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 448 transitions. [2018-04-11 15:32:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-04-11 15:32:06,470 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:32:06,471 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] [2018-04-11 15:32:06,471 INFO L408 AbstractCegarLoop]: === Iteration 59 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:32:06,471 INFO L82 PathProgramCache]: Analyzing trace with hash 499901649, now seen corresponding path program 47 times [2018-04-11 15:32:06,471 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:32:06,471 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:32:06,471 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:06,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:32:06,471 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:32:06,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:32:07,626 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:32:07,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:32:07,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:32:07,626 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:32:07,724 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-04-11 15:32:07,724 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:32:07,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:32:07,797 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:32:07,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:32:07,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 56] total 59 [2018-04-11 15:32:07,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-11 15:32:07,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-11 15:32:07,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1600, Invalid=1822, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:32:07,798 INFO L87 Difference]: Start difference. First operand 447 states and 448 transitions. Second operand 59 states. [2018-04-11 15:32:08,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:32:08,822 INFO L93 Difference]: Finished difference Result 459 states and 460 transitions. [2018-04-11 15:32:08,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-11 15:32:08,822 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 446 [2018-04-11 15:32:08,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:32:08,823 INFO L225 Difference]: With dead ends: 459 [2018-04-11 15:32:08,823 INFO L226 Difference]: Without dead ends: 459 [2018-04-11 15:32:08,824 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 500 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:32:08,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-04-11 15:32:08,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2018-04-11 15:32:08,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-04-11 15:32:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2018-04-11 15:32:08,826 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 446 [2018-04-11 15:32:08,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:32:08,826 INFO L459 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2018-04-11 15:32:08,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-11 15:32:08,826 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2018-04-11 15:32:08,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-04-11 15:32:08,827 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:32:08,828 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] [2018-04-11 15:32:08,828 INFO L408 AbstractCegarLoop]: === Iteration 60 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:32:08,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2065516047, now seen corresponding path program 48 times [2018-04-11 15:32:08,828 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:32:08,828 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:32:08,828 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:08,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:32:08,828 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:32:08,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:32:10,058 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:32:10,059 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:32:10,059 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:32:10,059 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:32:10,148 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-04-11 15:32:10,148 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:32:10,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:32:11,145 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:32:11,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:32:11,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58] total 114 [2018-04-11 15:32:11,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-04-11 15:32:11,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-04-11 15:32:11,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4789, Invalid=8093, Unknown=0, NotChecked=0, Total=12882 [2018-04-11 15:32:11,147 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 114 states. [2018-04-11 15:32:11,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:32:11,773 INFO L93 Difference]: Finished difference Result 467 states and 468 transitions. [2018-04-11 15:32:11,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-11 15:32:11,773 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 454 [2018-04-11 15:32:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:32:11,774 INFO L225 Difference]: With dead ends: 467 [2018-04-11 15:32:11,774 INFO L226 Difference]: Without dead ends: 467 [2018-04-11 15:32:11,775 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 399 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:32:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-04-11 15:32:11,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 463. [2018-04-11 15:32:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-04-11 15:32:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 464 transitions. [2018-04-11 15:32:11,777 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 464 transitions. Word has length 454 [2018-04-11 15:32:11,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:32:11,777 INFO L459 AbstractCegarLoop]: Abstraction has 463 states and 464 transitions. [2018-04-11 15:32:11,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-04-11 15:32:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 464 transitions. [2018-04-11 15:32:11,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-04-11 15:32:11,778 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:32:11,778 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] [2018-04-11 15:32:11,779 INFO L408 AbstractCegarLoop]: === Iteration 61 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:32:11,779 INFO L82 PathProgramCache]: Analyzing trace with hash 622880273, now seen corresponding path program 49 times [2018-04-11 15:32:11,779 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:32:11,779 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:32:11,779 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:11,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:32:11,779 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:32:11,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:32:13,056 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:32:13,056 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:32:13,056 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:32:13,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:32:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:32:13,092 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:32:14,061 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:32:14,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:32:14,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59] total 116 [2018-04-11 15:32:14,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-04-11 15:32:14,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-04-11 15:32:14,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4960, Invalid=8380, Unknown=0, NotChecked=0, Total=13340 [2018-04-11 15:32:14,063 INFO L87 Difference]: Start difference. First operand 463 states and 464 transitions. Second operand 116 states. [2018-04-11 15:32:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:32:14,740 INFO L93 Difference]: Finished difference Result 475 states and 476 transitions. [2018-04-11 15:32:14,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-11 15:32:14,741 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 462 [2018-04-11 15:32:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:32:14,742 INFO L225 Difference]: With dead ends: 475 [2018-04-11 15:32:14,742 INFO L226 Difference]: Without dead ends: 475 [2018-04-11 15:32:14,743 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 406 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6213 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=5075, Invalid=8497, Unknown=0, NotChecked=0, Total=13572 [2018-04-11 15:32:14,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-04-11 15:32:14,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2018-04-11 15:32:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-04-11 15:32:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 472 transitions. [2018-04-11 15:32:14,746 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 472 transitions. Word has length 462 [2018-04-11 15:32:14,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:32:14,746 INFO L459 AbstractCegarLoop]: Abstraction has 471 states and 472 transitions. [2018-04-11 15:32:14,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-04-11 15:32:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 472 transitions. [2018-04-11 15:32:14,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-04-11 15:32:14,747 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:32:14,747 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] [2018-04-11 15:32:14,747 INFO L408 AbstractCegarLoop]: === Iteration 62 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:32:14,748 INFO L82 PathProgramCache]: Analyzing trace with hash 602564913, now seen corresponding path program 50 times [2018-04-11 15:32:14,748 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:32:14,748 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:32:14,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:14,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:32:14,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:32:14,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:32:16,086 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:32:16,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:32:16,086 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:32:16,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:32:16,135 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:32:16,136 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:32:16,144 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:32:16,240 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:32:16,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:32:16,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 59] total 62 [2018-04-11 15:32:16,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-11 15:32:16,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-11 15:32:16,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1774, Invalid=2008, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 15:32:16,242 INFO L87 Difference]: Start difference. First operand 471 states and 472 transitions. Second operand 62 states. [2018-04-11 15:32:17,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:32:17,358 INFO L93 Difference]: Finished difference Result 483 states and 484 transitions. [2018-04-11 15:32:17,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-11 15:32:17,358 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 470 [2018-04-11 15:32:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:32:17,359 INFO L225 Difference]: With dead ends: 483 [2018-04-11 15:32:17,359 INFO L226 Difference]: Without dead ends: 483 [2018-04-11 15:32:17,359 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=5195, Invalid=8847, Unknown=0, NotChecked=0, Total=14042 [2018-04-11 15:32:17,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-04-11 15:32:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 479. [2018-04-11 15:32:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-04-11 15:32:17,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 480 transitions. [2018-04-11 15:32:17,362 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 480 transitions. Word has length 470 [2018-04-11 15:32:17,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:32:17,362 INFO L459 AbstractCegarLoop]: Abstraction has 479 states and 480 transitions. [2018-04-11 15:32:17,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-11 15:32:17,362 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 480 transitions. [2018-04-11 15:32:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-04-11 15:32:17,363 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:32:17,363 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] [2018-04-11 15:32:17,363 INFO L408 AbstractCegarLoop]: === Iteration 63 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:32:17,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1092205743, now seen corresponding path program 51 times [2018-04-11 15:32:17,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:32:17,364 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:32:17,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:17,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:32:17,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:32:17,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:32:18,741 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:32:18,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:32:18,741 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:32:18,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:32:18,826 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-04-11 15:32:18,826 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:32:18,852 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:32:18,934 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:32:18,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:32:18,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 60] total 63 [2018-04-11 15:32:18,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-11 15:32:18,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-11 15:32:18,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2018-04-11 15:32:18,936 INFO L87 Difference]: Start difference. First operand 479 states and 480 transitions. Second operand 63 states. [2018-04-11 15:32:20,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:32:20,107 INFO L93 Difference]: Finished difference Result 491 states and 492 transitions. [2018-04-11 15:32:20,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-11 15:32:20,107 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 478 [2018-04-11 15:32:20,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:32:20,108 INFO L225 Difference]: With dead ends: 491 [2018-04-11 15:32:20,108 INFO L226 Difference]: Without dead ends: 491 [2018-04-11 15:32:20,109 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 536 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:32:20,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-04-11 15:32:20,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 487. [2018-04-11 15:32:20,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-04-11 15:32:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 488 transitions. [2018-04-11 15:32:20,111 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 488 transitions. Word has length 478 [2018-04-11 15:32:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:32:20,111 INFO L459 AbstractCegarLoop]: Abstraction has 487 states and 488 transitions. [2018-04-11 15:32:20,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-11 15:32:20,111 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 488 transitions. [2018-04-11 15:32:20,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-04-11 15:32:20,112 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:32:20,113 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] [2018-04-11 15:32:20,113 INFO L408 AbstractCegarLoop]: === Iteration 64 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:32:20,113 INFO L82 PathProgramCache]: Analyzing trace with hash 737768561, now seen corresponding path program 52 times [2018-04-11 15:32:20,113 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:32:20,113 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:32:20,113 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:20,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:32:20,113 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:32:20,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:32:21,527 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:32:21,528 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:32:21,528 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:32:21,528 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:32:21,637 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:32:21,638 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:32:21,655 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:32:21,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:32:21,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:32:21,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:32:21,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:32:26,070 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:32:26,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:32:26,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 122] total 183 [2018-04-11 15:32:26,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-04-11 15:32:26,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-04-11 15:32:26,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7442, Invalid=25864, Unknown=0, NotChecked=0, Total=33306 [2018-04-11 15:32:26,072 INFO L87 Difference]: Start difference. First operand 487 states and 488 transitions. Second operand 183 states. [2018-04-11 15:32:28,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:32:28,333 INFO L93 Difference]: Finished difference Result 499 states and 500 transitions. [2018-04-11 15:32:28,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-11 15:32:28,333 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 486 [2018-04-11 15:32:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:32:28,334 INFO L225 Difference]: With dead ends: 499 [2018-04-11 15:32:28,334 INFO L226 Difference]: Without dead ends: 499 [2018-04-11 15:32:28,336 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 367 SyntacticMatches, 1 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24717 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=13003, Invalid=46777, Unknown=0, NotChecked=0, Total=59780 [2018-04-11 15:32:28,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-04-11 15:32:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 495. [2018-04-11 15:32:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-04-11 15:32:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 496 transitions. [2018-04-11 15:32:28,339 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 496 transitions. Word has length 486 [2018-04-11 15:32:28,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:32:28,339 INFO L459 AbstractCegarLoop]: Abstraction has 495 states and 496 transitions. [2018-04-11 15:32:28,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-04-11 15:32:28,339 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 496 transitions. [2018-04-11 15:32:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2018-04-11 15:32:28,340 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:32:28,340 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] [2018-04-11 15:32:28,341 INFO L408 AbstractCegarLoop]: === Iteration 65 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:32:28,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2034859153, now seen corresponding path program 53 times [2018-04-11 15:32:28,341 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:32:28,341 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:32:28,341 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:28,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:32:28,341 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:32:28,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:32:29,853 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:32:29,853 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:32:29,853 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:32:29,854 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:32:30,010 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-04-11 15:32:30,010 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:32:30,023 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:32:30,125 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:32:30,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:32:30,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 62] total 65 [2018-04-11 15:32:30,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-11 15:32:30,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-11 15:32:30,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 15:32:30,126 INFO L87 Difference]: Start difference. First operand 495 states and 496 transitions. Second operand 65 states. [2018-04-11 15:32:31,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:32:31,356 INFO L93 Difference]: Finished difference Result 507 states and 508 transitions. [2018-04-11 15:32:31,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-11 15:32:31,356 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 494 [2018-04-11 15:32:31,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:32:31,357 INFO L225 Difference]: With dead ends: 507 [2018-04-11 15:32:31,357 INFO L226 Difference]: Without dead ends: 507 [2018-04-11 15:32:31,358 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2003 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5738, Invalid=9762, Unknown=0, NotChecked=0, Total=15500 [2018-04-11 15:32:31,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-04-11 15:32:31,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 503. [2018-04-11 15:32:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-04-11 15:32:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 504 transitions. [2018-04-11 15:32:31,361 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 504 transitions. Word has length 494 [2018-04-11 15:32:31,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:32:31,361 INFO L459 AbstractCegarLoop]: Abstraction has 503 states and 504 transitions. [2018-04-11 15:32:31,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-11 15:32:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 504 transitions. [2018-04-11 15:32:31,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-04-11 15:32:31,362 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:32:31,363 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] [2018-04-11 15:32:31,363 INFO L408 AbstractCegarLoop]: === Iteration 66 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:32:31,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1832639409, now seen corresponding path program 54 times [2018-04-11 15:32:31,363 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:32:31,363 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:32:31,363 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:31,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:32:31,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:32:31,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:32:32,911 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:32:32,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:32:32,912 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:32:32,912 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:32:33,019 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-04-11 15:32:33,019 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:32:33,051 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:32:33,135 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:32:33,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:32:33,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 63] total 66 [2018-04-11 15:32:33,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-11 15:32:33,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-11 15:32:33,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2020, Invalid=2270, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 15:32:33,136 INFO L87 Difference]: Start difference. First operand 503 states and 504 transitions. Second operand 66 states. [2018-04-11 15:32:34,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:32:34,396 INFO L93 Difference]: Finished difference Result 515 states and 516 transitions. [2018-04-11 15:32:34,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-11 15:32:34,396 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 502 [2018-04-11 15:32:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:32:34,397 INFO L225 Difference]: With dead ends: 515 [2018-04-11 15:32:34,397 INFO L226 Difference]: Without dead ends: 515 [2018-04-11 15:32:34,398 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5925, Invalid=10077, Unknown=0, NotChecked=0, Total=16002 [2018-04-11 15:32:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-04-11 15:32:34,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2018-04-11 15:32:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-04-11 15:32:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2018-04-11 15:32:34,400 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 502 [2018-04-11 15:32:34,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:32:34,400 INFO L459 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2018-04-11 15:32:34,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-11 15:32:34,400 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2018-04-11 15:32:34,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-04-11 15:32:34,402 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:32:34,402 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] [2018-04-11 15:32:34,402 INFO L408 AbstractCegarLoop]: === Iteration 67 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:32:34,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1719013841, now seen corresponding path program 55 times [2018-04-11 15:32:34,402 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:32:34,402 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:32:34,403 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:34,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:32:34,403 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:32:34,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:32:35,992 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:32:35,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:32:35,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:32:35,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:32:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:32:36,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:32:37,143 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:32:37,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:32:37,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65] total 128 [2018-04-11 15:32:37,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-04-11 15:32:37,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-04-11 15:32:37,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6049, Invalid=10207, Unknown=0, NotChecked=0, Total=16256 [2018-04-11 15:32:37,146 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 128 states. [2018-04-11 15:32:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:32:37,915 INFO L93 Difference]: Finished difference Result 523 states and 524 transitions. [2018-04-11 15:32:37,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-11 15:32:37,915 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 510 [2018-04-11 15:32:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:32:37,916 INFO L225 Difference]: With dead ends: 523 [2018-04-11 15:32:37,916 INFO L226 Difference]: Without dead ends: 523 [2018-04-11 15:32:37,917 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7623 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=6176, Invalid=10336, Unknown=0, NotChecked=0, Total=16512 [2018-04-11 15:32:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-04-11 15:32:37,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2018-04-11 15:32:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-04-11 15:32:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 520 transitions. [2018-04-11 15:32:37,919 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 520 transitions. Word has length 510 [2018-04-11 15:32:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:32:37,919 INFO L459 AbstractCegarLoop]: Abstraction has 519 states and 520 transitions. [2018-04-11 15:32:37,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-04-11 15:32:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 520 transitions. [2018-04-11 15:32:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-04-11 15:32:37,921 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:32:37,921 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] [2018-04-11 15:32:37,921 INFO L408 AbstractCegarLoop]: === Iteration 68 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:32:37,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1004379889, now seen corresponding path program 56 times [2018-04-11 15:32:37,921 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:32:37,921 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:32:37,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:37,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:32:37,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:32:37,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:32:39,579 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:32:39,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:32:39,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:32:39,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:32:39,631 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:32:39,631 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:32:39,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:32:39,727 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:32:39,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:32:39,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 65] total 68 [2018-04-11 15:32:39,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-11 15:32:39,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-11 15:32:39,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2149, Invalid=2407, Unknown=0, NotChecked=0, Total=4556 [2018-04-11 15:32:39,728 INFO L87 Difference]: Start difference. First operand 519 states and 520 transitions. Second operand 68 states. [2018-04-11 15:32:41,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:32:41,016 INFO L93 Difference]: Finished difference Result 531 states and 532 transitions. [2018-04-11 15:32:41,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-11 15:32:41,016 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 518 [2018-04-11 15:32:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:32:41,018 INFO L225 Difference]: With dead ends: 531 [2018-04-11 15:32:41,018 INFO L226 Difference]: Without dead ends: 531 [2018-04-11 15:32:41,019 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 581 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:32:41,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-04-11 15:32:41,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 527. [2018-04-11 15:32:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-04-11 15:32:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 528 transitions. [2018-04-11 15:32:41,021 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 528 transitions. Word has length 518 [2018-04-11 15:32:41,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:32:41,021 INFO L459 AbstractCegarLoop]: Abstraction has 527 states and 528 transitions. [2018-04-11 15:32:41,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-11 15:32:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 528 transitions. [2018-04-11 15:32:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2018-04-11 15:32:41,023 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:32:41,023 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] [2018-04-11 15:32:41,023 INFO L408 AbstractCegarLoop]: === Iteration 69 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:32:41,023 INFO L82 PathProgramCache]: Analyzing trace with hash 479724305, now seen corresponding path program 57 times [2018-04-11 15:32:41,023 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:32:41,023 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:32:41,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:41,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:32:41,024 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:32:41,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:32:42,723 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:32:42,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:32:42,723 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:32:42,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:32:42,869 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-04-11 15:32:42,870 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:32:42,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:32:44,120 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:32:44,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:32:44,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67] total 132 [2018-04-11 15:32:44,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-04-11 15:32:44,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-04-11 15:32:44,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6436, Invalid=10856, Unknown=0, NotChecked=0, Total=17292 [2018-04-11 15:32:44,145 INFO L87 Difference]: Start difference. First operand 527 states and 528 transitions. Second operand 132 states. [2018-04-11 15:32:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:32:44,941 INFO L93 Difference]: Finished difference Result 539 states and 540 transitions. [2018-04-11 15:32:44,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-11 15:32:44,942 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 526 [2018-04-11 15:32:44,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:32:44,943 INFO L225 Difference]: With dead ends: 539 [2018-04-11 15:32:44,943 INFO L226 Difference]: Without dead ends: 539 [2018-04-11 15:32:44,944 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 462 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:32:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-04-11 15:32:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 535. [2018-04-11 15:32:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-04-11 15:32:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 536 transitions. [2018-04-11 15:32:44,946 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 536 transitions. Word has length 526 [2018-04-11 15:32:44,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:32:44,946 INFO L459 AbstractCegarLoop]: Abstraction has 535 states and 536 transitions. [2018-04-11 15:32:44,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-04-11 15:32:44,946 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 536 transitions. [2018-04-11 15:32:44,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-04-11 15:32:44,948 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:32:44,948 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] [2018-04-11 15:32:44,948 INFO L408 AbstractCegarLoop]: === Iteration 70 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:32:44,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1879752241, now seen corresponding path program 58 times [2018-04-11 15:32:44,948 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:32:44,948 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:32:44,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:44,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:32:44,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:32:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:32:44,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:32:46,701 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:32:46,701 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:32:46,701 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:32:46,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:32:46,848 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:32:46,849 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:32:46,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:32:46,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:32:46,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:32:46,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:32:46,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:32:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 191 proven. 16193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:32:53,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:32:53,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 135] total 202 [2018-04-11 15:32:53,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-04-11 15:32:53,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-04-11 15:32:53,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7163, Invalid=33439, Unknown=0, NotChecked=0, Total=40602 [2018-04-11 15:32:53,554 INFO L87 Difference]: Start difference. First operand 535 states and 536 transitions. Second operand 202 states. [2018-04-11 15:33:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:01,607 INFO L93 Difference]: Finished difference Result 547 states and 548 transitions. [2018-04-11 15:33:01,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-11 15:33:01,608 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 534 [2018-04-11 15:33:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:01,608 INFO L225 Difference]: With dead ends: 547 [2018-04-11 15:33:01,608 INFO L226 Difference]: Without dead ends: 547 [2018-04-11 15:33:01,610 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28082 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=9842, Invalid=62788, Unknown=0, NotChecked=0, Total=72630 [2018-04-11 15:33:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-04-11 15:33:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 543. [2018-04-11 15:33:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-04-11 15:33:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 544 transitions. [2018-04-11 15:33:01,613 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 544 transitions. Word has length 534 [2018-04-11 15:33:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:01,613 INFO L459 AbstractCegarLoop]: Abstraction has 543 states and 544 transitions. [2018-04-11 15:33:01,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-04-11 15:33:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 544 transitions. [2018-04-11 15:33:01,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2018-04-11 15:33:01,615 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:01,615 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] [2018-04-11 15:33:01,615 INFO L408 AbstractCegarLoop]: === Iteration 71 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:01,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1243918255, now seen corresponding path program 59 times [2018-04-11 15:33:01,615 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:01,615 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:01,616 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:01,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:01,616 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:01,672 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:03,461 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:33:03,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:03,461 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:03,462 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:33:03,611 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-04-11 15:33:03,611 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:03,620 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:03,716 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:33:03,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:03,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 68] total 71 [2018-04-11 15:33:03,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-11 15:33:03,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-11 15:33:03,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2350, Invalid=2620, Unknown=0, NotChecked=0, Total=4970 [2018-04-11 15:33:03,717 INFO L87 Difference]: Start difference. First operand 543 states and 544 transitions. Second operand 71 states. [2018-04-11 15:33:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:05,125 INFO L93 Difference]: Finished difference Result 555 states and 556 transitions. [2018-04-11 15:33:05,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-11 15:33:05,126 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 542 [2018-04-11 15:33:05,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:05,127 INFO L225 Difference]: With dead ends: 555 [2018-04-11 15:33:05,127 INFO L226 Difference]: Without dead ends: 555 [2018-04-11 15:33:05,127 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 608 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=6905, Invalid=11727, Unknown=0, NotChecked=0, Total=18632 [2018-04-11 15:33:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-04-11 15:33:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 551. [2018-04-11 15:33:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-04-11 15:33:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 552 transitions. [2018-04-11 15:33:05,130 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 552 transitions. Word has length 542 [2018-04-11 15:33:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:05,130 INFO L459 AbstractCegarLoop]: Abstraction has 551 states and 552 transitions. [2018-04-11 15:33:05,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-11 15:33:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 552 transitions. [2018-04-11 15:33:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2018-04-11 15:33:05,132 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:05,132 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] [2018-04-11 15:33:05,132 INFO L408 AbstractCegarLoop]: === Iteration 72 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:05,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1710176625, now seen corresponding path program 60 times [2018-04-11 15:33:05,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:05,132 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:05,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:05,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:05,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:05,184 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:07,008 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:33:07,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:07,008 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:07,008 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:33:07,199 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-04-11 15:33:07,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:07,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:07,372 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:33:07,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:07,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 69] total 72 [2018-04-11 15:33:07,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-11 15:33:07,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-11 15:33:07,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=2693, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 15:33:07,373 INFO L87 Difference]: Start difference. First operand 551 states and 552 transitions. Second operand 72 states. [2018-04-11 15:33:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:08,815 INFO L93 Difference]: Finished difference Result 563 states and 564 transitions. [2018-04-11 15:33:08,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-11 15:33:08,815 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 550 [2018-04-11 15:33:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:08,816 INFO L225 Difference]: With dead ends: 563 [2018-04-11 15:33:08,816 INFO L226 Difference]: Without dead ends: 563 [2018-04-11 15:33:08,817 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 617 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:33:08,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-04-11 15:33:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 559. [2018-04-11 15:33:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-04-11 15:33:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 560 transitions. [2018-04-11 15:33:08,819 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 560 transitions. Word has length 550 [2018-04-11 15:33:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:08,819 INFO L459 AbstractCegarLoop]: Abstraction has 559 states and 560 transitions. [2018-04-11 15:33:08,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-11 15:33:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 560 transitions. [2018-04-11 15:33:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2018-04-11 15:33:08,821 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:08,821 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] [2018-04-11 15:33:08,821 INFO L408 AbstractCegarLoop]: === Iteration 73 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:08,822 INFO L82 PathProgramCache]: Analyzing trace with hash -798230127, now seen corresponding path program 61 times [2018-04-11 15:33:08,822 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:08,822 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:08,822 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:08,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:08,822 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:08,871 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:10,788 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:33:10,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:10,789 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:10,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:10,833 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:12,244 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:33:12,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:12,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 71] total 140 [2018-04-11 15:33:12,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-04-11 15:33:12,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-04-11 15:33:12,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7246, Invalid=12214, Unknown=0, NotChecked=0, Total=19460 [2018-04-11 15:33:12,247 INFO L87 Difference]: Start difference. First operand 559 states and 560 transitions. Second operand 140 states. [2018-04-11 15:33:13,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:13,213 INFO L93 Difference]: Finished difference Result 571 states and 572 transitions. [2018-04-11 15:33:13,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-11 15:33:13,213 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 558 [2018-04-11 15:33:13,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:13,214 INFO L225 Difference]: With dead ends: 571 [2018-04-11 15:33:13,214 INFO L226 Difference]: Without dead ends: 571 [2018-04-11 15:33:13,215 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 490 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9177 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=7385, Invalid=12355, Unknown=0, NotChecked=0, Total=19740 [2018-04-11 15:33:13,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-04-11 15:33:13,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 567. [2018-04-11 15:33:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-04-11 15:33:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 568 transitions. [2018-04-11 15:33:13,218 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 568 transitions. Word has length 558 [2018-04-11 15:33:13,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:13,218 INFO L459 AbstractCegarLoop]: Abstraction has 567 states and 568 transitions. [2018-04-11 15:33:13,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-04-11 15:33:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 568 transitions. [2018-04-11 15:33:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2018-04-11 15:33:13,220 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:13,220 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] [2018-04-11 15:33:13,220 INFO L408 AbstractCegarLoop]: === Iteration 74 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:13,220 INFO L82 PathProgramCache]: Analyzing trace with hash -38334287, now seen corresponding path program 62 times [2018-04-11 15:33:13,220 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:13,220 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:13,220 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:13,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:33:13,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:13,275 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:15,222 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:33:15,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:15,223 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:15,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:33:15,294 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:33:15,295 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:15,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:15,410 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:33:15,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:15,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 71] total 74 [2018-04-11 15:33:15,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-11 15:33:15,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-11 15:33:15,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2560, Invalid=2842, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 15:33:15,417 INFO L87 Difference]: Start difference. First operand 567 states and 568 transitions. Second operand 74 states. [2018-04-11 15:33:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:16,941 INFO L93 Difference]: Finished difference Result 579 states and 580 transitions. [2018-04-11 15:33:16,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-11 15:33:16,941 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 566 [2018-04-11 15:33:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:16,942 INFO L225 Difference]: With dead ends: 579 [2018-04-11 15:33:16,942 INFO L226 Difference]: Without dead ends: 579 [2018-04-11 15:33:16,943 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 776 GetRequests, 635 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:33:16,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-04-11 15:33:16,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 575. [2018-04-11 15:33:16,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-04-11 15:33:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 576 transitions. [2018-04-11 15:33:16,945 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 576 transitions. Word has length 566 [2018-04-11 15:33:16,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:16,946 INFO L459 AbstractCegarLoop]: Abstraction has 575 states and 576 transitions. [2018-04-11 15:33:16,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-11 15:33:16,946 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 576 transitions. [2018-04-11 15:33:16,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2018-04-11 15:33:16,947 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:16,948 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] [2018-04-11 15:33:16,948 INFO L408 AbstractCegarLoop]: === Iteration 75 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:16,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1904869679, now seen corresponding path program 63 times [2018-04-11 15:33:16,948 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:16,948 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:16,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:16,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:16,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:17,000 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:19,021 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:33:19,022 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:19,022 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:19,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:33:19,135 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-04-11 15:33:19,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:19,176 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:19,286 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:33:19,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:19,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 72] total 75 [2018-04-11 15:33:19,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-11 15:33:19,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-11 15:33:19,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2632, Invalid=2918, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 15:33:19,287 INFO L87 Difference]: Start difference. First operand 575 states and 576 transitions. Second operand 75 states. [2018-04-11 15:33:20,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:20,852 INFO L93 Difference]: Finished difference Result 587 states and 588 transitions. [2018-04-11 15:33:20,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-11 15:33:20,852 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 574 [2018-04-11 15:33:20,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:20,853 INFO L225 Difference]: With dead ends: 587 [2018-04-11 15:33:20,853 INFO L226 Difference]: Without dead ends: 587 [2018-04-11 15:33:20,854 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 787 GetRequests, 644 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:33:20,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-04-11 15:33:20,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 583. [2018-04-11 15:33:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-04-11 15:33:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 584 transitions. [2018-04-11 15:33:20,857 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 584 transitions. Word has length 574 [2018-04-11 15:33:20,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:20,857 INFO L459 AbstractCegarLoop]: Abstraction has 583 states and 584 transitions. [2018-04-11 15:33:20,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-11 15:33:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 584 transitions. [2018-04-11 15:33:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2018-04-11 15:33:20,859 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:20,859 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] [2018-04-11 15:33:20,859 INFO L408 AbstractCegarLoop]: === Iteration 76 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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:20,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1685175311, now seen corresponding path program 64 times [2018-04-11 15:33:20,859 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:20,859 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:20,859 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:20,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:20,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:20,918 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:23,012 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:33:23,012 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:23,012 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:23,012 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:33:23,190 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:33:23,191 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:23,219 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:23,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:23,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:33:23,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:33:23,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:33:29,749 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:33:29,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:29,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 146] total 219 [2018-04-11 15:33:29,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-04-11 15:33:29,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-04-11 15:33:29,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10658, Invalid=37084, Unknown=0, NotChecked=0, Total=47742 [2018-04-11 15:33:29,752 INFO L87 Difference]: Start difference. First operand 583 states and 584 transitions. Second operand 219 states. [2018-04-11 15:33:33,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:33,468 INFO L93 Difference]: Finished difference Result 595 states and 596 transitions. [2018-04-11 15:33:33,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-11 15:33:33,468 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 582 [2018-04-11 15:33:33,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:33,469 INFO L225 Difference]: With dead ends: 595 [2018-04-11 15:33:33,469 INFO L226 Difference]: Without dead ends: 595 [2018-04-11 15:33:33,470 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35709 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=18625, Invalid=66931, Unknown=0, NotChecked=0, Total=85556 [2018-04-11 15:33:33,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-04-11 15:33:33,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 591. [2018-04-11 15:33:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-04-11 15:33:33,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 592 transitions. [2018-04-11 15:33:33,473 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 592 transitions. Word has length 582 [2018-04-11 15:33:33,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:33,473 INFO L459 AbstractCegarLoop]: Abstraction has 591 states and 592 transitions. [2018-04-11 15:33:33,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-04-11 15:33:33,473 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 592 transitions. [2018-04-11 15:33:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2018-04-11 15:33:33,475 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:33,475 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] [2018-04-11 15:33:33,475 INFO L408 AbstractCegarLoop]: === Iteration 77 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1775935471, now seen corresponding path program 65 times [2018-04-11 15:33:33,476 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:33,476 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:33,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:33,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:33,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:33,530 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:35,724 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:33:35,724 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:35,724 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:35,724 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:33:35,899 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-04-11 15:33:35,900 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:35,914 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:36,031 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:33:36,031 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:36,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 74] total 77 [2018-04-11 15:33:36,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-11 15:33:36,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-11 15:33:36,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2779, Invalid=3073, Unknown=0, NotChecked=0, Total=5852 [2018-04-11 15:33:36,032 INFO L87 Difference]: Start difference. First operand 591 states and 592 transitions. Second operand 77 states. [2018-04-11 15:33:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:33:37,789 INFO L93 Difference]: Finished difference Result 603 states and 604 transitions. [2018-04-11 15:33:37,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-11 15:33:37,790 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 590 [2018-04-11 15:33:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:33:37,791 INFO L225 Difference]: With dead ends: 603 [2018-04-11 15:33:37,791 INFO L226 Difference]: Without dead ends: 603 [2018-04-11 15:33:37,792 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2837 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=8180, Invalid=13872, Unknown=0, NotChecked=0, Total=22052 [2018-04-11 15:33:37,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-04-11 15:33:37,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 599. [2018-04-11 15:33:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-04-11 15:33:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 600 transitions. [2018-04-11 15:33:37,795 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 600 transitions. Word has length 590 [2018-04-11 15:33:37,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:33:37,795 INFO L459 AbstractCegarLoop]: Abstraction has 599 states and 600 transitions. [2018-04-11 15:33:37,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-11 15:33:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 600 transitions. [2018-04-11 15:33:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2018-04-11 15:33:37,797 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:33:37,797 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] [2018-04-11 15:33:37,797 INFO L408 AbstractCegarLoop]: === Iteration 78 === [__U_MULTI_f_________false_valid_deref_i__fooErr0RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_deref_i__fooErr2RequiresViolation, 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,797 INFO L82 PathProgramCache]: Analyzing trace with hash 664851249, now seen corresponding path program 66 times [2018-04-11 15:33:37,797 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:33:37,797 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:33:37,798 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:37,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:33:37,798 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:33:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:33:37,865 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,198 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:33:40,198 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:33:40,198 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:33:40,199 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:33:40,583 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-04-11 15:33:40,583 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:33:40,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:33:40,776 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:33:40,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:33:40,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 75] total 78 [2018-04-11 15:33:40,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-11 15:33:40,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-11 15:33:40,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2854, Invalid=3152, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 15:33:40,777 INFO L87 Difference]: Start difference. First operand 599 states and 600 transitions. Second operand 78 states. Received shutdown request... [2018-04-11 15:33:41,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-11 15:33:41,418 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 15:33:41,420 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 15:33:41,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:33:41 BoogieIcfgContainer [2018-04-11 15:33:41,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:33:41,421 INFO L168 Benchmark]: Toolchain (without parser) took 172948.48 ms. Allocated memory was 404.8 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 337.7 MB in the beginning and 874.2 MB in the end (delta: -536.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-04-11 15:33:41,422 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 404.8 MB. Free memory is still 364.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:33:41,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.93 ms. Allocated memory is still 404.8 MB. Free memory was 337.2 MB in the beginning and 313.3 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:33:41,422 INFO L168 Benchmark]: Boogie Preprocessor took 39.74 ms. Allocated memory is still 404.8 MB. Free memory was 313.3 MB in the beginning and 310.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:33:41,422 INFO L168 Benchmark]: RCFGBuilder took 341.24 ms. Allocated memory was 404.8 MB in the beginning and 596.1 MB in the end (delta: 191.4 MB). Free memory was 310.6 MB in the beginning and 533.4 MB in the end (delta: -222.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 5.3 GB. [2018-04-11 15:33:41,423 INFO L168 Benchmark]: TraceAbstraction took 172320.01 ms. Allocated memory was 596.1 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 533.4 MB in the beginning and 874.2 MB in the end (delta: -340.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-04-11 15:33:41,424 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.10 ms. Allocated memory is still 404.8 MB. Free memory is still 364.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 244.93 ms. Allocated memory is still 404.8 MB. Free memory was 337.2 MB in the beginning and 313.3 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.74 ms. Allocated memory is still 404.8 MB. Free memory was 313.3 MB in the beginning and 310.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 341.24 ms. Allocated memory was 404.8 MB in the beginning and 596.1 MB in the end (delta: 191.4 MB). Free memory was 310.6 MB in the beginning and 533.4 MB in the end (delta: -222.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 172320.01 ms. Allocated memory was 596.1 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 533.4 MB in the beginning and 874.2 MB in the end (delta: -340.9 MB). Peak memory consumption was 1.5 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 (599states) and interpolant automaton (currently 44 states, 78 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 (599states) and interpolant automaton (currently 44 states, 78 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 (599states) and interpolant automaton (currently 44 states, 78 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 (599states) and interpolant automaton (currently 44 states, 78 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 (599states) and interpolant automaton (currently 44 states, 78 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 (599states) and interpolant automaton (currently 44 states, 78 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 (599states) and interpolant automaton (currently 44 states, 78 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 (599states) and interpolant automaton (currently 44 states, 78 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 (599states) and interpolant automaton (currently 44 states, 78 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 (599states) and interpolant automaton (currently 44 states, 78 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 (599states) and interpolant automaton (currently 44 states, 78 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 (599states) and interpolant automaton (currently 44 states, 78 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 (599states) and interpolant automaton (currently 44 states, 78 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 (599states) and interpolant automaton (currently 44 states, 78 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 (599states) and interpolant automaton (currently 44 states, 78 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 (599states) and interpolant automaton (currently 44 states, 78 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 (599states) and interpolant automaton (currently 44 states, 78 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, 172.2s OverallTime, 78 OverallIterations, 73 TraceHistogramMax, 59.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1718 SDtfs, 35494 SDslu, 37511 SDs, 0 SdLazy, 51951 SolverSat, 9197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28790 GetRequests, 22156 SyntacticMatches, 32 SemanticMatches, 6601 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270653 ImplicationChecksByTransitivity, 101.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=599occurred in iteration=77, 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, 77 MinimizatonAttempts, 323 StatesRemovedByMinimization, 73 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 102.2s InterpolantComputationTime, 45200 NumberOfCodeBlocks, 44714 NumberOfCodeBlocksAsserted, 1509 NumberOfCheckSat, 44943 ConstructedInterpolants, 130 QuantifiedInterpolants, 69822415 SizeOfPredicates, 161 NumberOfNonLiveVariables, 55961 ConjunctsInSsa, 3565 ConjunctsInUnsatCore, 148 InterpolantComputations, 7 PerfectInterpolantSequences, 499815/1015788 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-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-33-41-430.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-33-41-430.csv Completed graceful shutdown