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/lockfree-3.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:36:36,614 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:36:36,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:36:36,628 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:36:36,629 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:36:36,629 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:36:36,630 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:36:36,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:36:36,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:36:36,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:36:36,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:36:36,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:36:36,636 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:36:36,636 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:36:36,637 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:36:36,639 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:36:36,640 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:36:36,641 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:36:36,642 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:36:36,643 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:36:36,645 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:36:36,645 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:36:36,645 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:36:36,646 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:36:36,647 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:36:36,648 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:36:36,648 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:36:36,648 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:36:36,649 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:36:36,649 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:36:36,649 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:36:36,650 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:36:36,671 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:36:36,671 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:36:36,672 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:36:36,672 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:36:36,672 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:36:36,672 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:36:36,672 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:36:36,672 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:36:36,673 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:36:36,673 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:36:36,673 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:36:36,673 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:36:36,673 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:36:36,673 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:36:36,673 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:36:36,674 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:36:36,674 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:36:36,674 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:36:36,674 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:36:36,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:36:36,674 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:36:36,674 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:36:36,675 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:36:36,675 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:36:36,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:36:36,713 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:36:36,717 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:36:36,718 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:36:36,718 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:36:36,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,040 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG709b46a43 [2018-04-11 15:36:37,178 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:36:37,178 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:36:37,179 INFO L168 CDTParser]: Scanning lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,186 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:36:37,186 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:36:37,186 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:36:37,186 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,186 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flockfree_____false_valid_memtrack_i__push ('push') in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,186 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flockfree_____false_valid_memtrack_i__pop ('pop') in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,186 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:36:37,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____clockid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____daddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__clockid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____clock_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__quad_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_int in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint8_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____key_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blkcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int8_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int16_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_cond_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____loff_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__suseconds_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____useconds_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fd_mask in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__wchar_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____off_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ino64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_long in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__nlink_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__uint in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ssize_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____sigset_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_once_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__dev_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ino_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_spinlock_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__id_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int8_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_short in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ulong in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__gid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__S in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsfilcnt64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ldiv_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ino_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____swblk_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_barrierattr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__register_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__clock_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int8_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____dev_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____time_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__daddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_quad_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ushort in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__loff_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__t4 in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsfilcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__t1 in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_condattr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint16_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____WAIT_STATUS in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____rlim64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blksize_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____qaddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int32_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__div_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__garbage in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__time_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____suseconds_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__key_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_mutex_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__uid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fd_set in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__lldiv_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____rlim_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int16_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__mode_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pc1 in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_short in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pc4 in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____intptr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_key_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsblkcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____caddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__size_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_rwlock_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint32_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__caddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__blksize_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____mode_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__sigset_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_char in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__timer_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_long in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int16_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__off_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__blkcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blkcnt64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int32_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_rwlockattr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsfilcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ssize_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____pthread_list_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____socklen_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____nlink_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_attr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int32_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_char in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____gid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_quad_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____sig_atomic_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_barrier_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____id_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__x1 in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____quad_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fd_mask in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____off64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsblkcnt64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__x4 in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____pid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsblkcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____timer_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_mutexattr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int in lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,208 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG709b46a43 [2018-04-11 15:36:37,211 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:36:37,212 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:36:37,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:36:37,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:36:37,216 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:36:37,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:36:37" (1/1) ... [2018-04-11 15:36:37,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76804c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:36:37, skipping insertion in model container [2018-04-11 15:36:37,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:36:37" (1/1) ... [2018-04-11 15:36:37,231 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:36:37,253 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:36:37,377 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:36:37,415 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:36:37,421 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-11 15:36:37,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:36:37 WrapperNode [2018-04-11 15:36:37,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:36:37,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:36:37,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:36:37,451 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:36:37,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:36:37" (1/1) ... [2018-04-11 15:36:37,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:36:37" (1/1) ... [2018-04-11 15:36:37,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:36:37" (1/1) ... [2018-04-11 15:36:37,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:36:37" (1/1) ... [2018-04-11 15:36:37,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:36:37" (1/1) ... [2018-04-11 15:36:37,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:36:37" (1/1) ... [2018-04-11 15:36:37,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:36:37" (1/1) ... [2018-04-11 15:36:37,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:36:37,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:36:37,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:36:37,491 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:36:37,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:36:37" (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:36:37,574 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:36:37,574 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:36:37,574 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-11 15:36:37,574 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-11 15:36:37,574 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:36:37,574 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 15:36:37,574 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:36:37,574 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:36:37,574 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:36:37,574 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:36:37,575 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:36:37,575 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:36:37,575 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:36:37,575 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:36:37,575 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:36:37,575 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:36:37,575 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:36:37,575 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:36:37,575 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:36:37,575 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:36:37,576 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:36:37,576 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:36:37,576 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:36:37,576 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:36:37,576 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:36:37,576 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:36:37,576 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:36:37,576 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:36:37,576 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:36:37,577 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:36:37,577 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:36:37,577 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:36:37,577 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:36:37,577 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:36:37,577 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:36:37,577 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:36:37,577 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:36:37,577 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:36:37,577 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:36:37,578 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:36:37,578 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:36:37,578 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:36:37,578 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:36:37,578 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:36:37,578 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:36:37,578 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:36:37,578 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:36:37,578 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:36:37,579 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:36:37,579 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:36:37,579 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:36:37,579 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:36:37,579 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:36:37,579 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:36:37,579 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:36:37,579 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:36:37,579 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:36:37,579 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:36:37,580 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:36:37,580 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:36:37,580 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:36:37,580 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:36:37,580 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:36:37,580 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:36:37,580 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:36:37,580 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:36:37,580 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:36:37,580 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:36:37,581 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:36:37,581 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:36:37,581 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 15:36:37,581 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:36:37,581 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:36:37,581 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:36:37,581 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:36:37,581 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:36:37,581 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:36:37,581 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:36:37,581 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:36:37,582 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:36:37,582 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:36:37,582 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:36:37,582 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:36:37,582 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:36:37,582 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:36:37,582 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:36:37,582 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:36:37,582 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:36:37,582 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:36:37,583 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:36:37,583 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:36:37,583 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:36:37,583 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:36:37,583 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:36:37,583 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:36:37,583 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:36:37,583 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:36:37,583 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:36:37,583 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:36:37,584 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:36:37,584 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:36:37,584 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:36:37,584 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:36:37,584 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:36:37,584 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:36:37,584 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:36:37,584 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:36:37,584 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:36:37,584 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-11 15:36:37,585 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:36:37,585 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:36:37,585 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 15:36:37,585 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-11 15:36:37,585 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 15:36:37,585 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:36:37,585 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:36:37,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:36:37,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:36:37,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:36:37,585 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:36:37,914 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:36:37,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:36:37 BoogieIcfgContainer [2018-04-11 15:36:37,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:36:37,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:36:37,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:36:37,918 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:36:37,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:36:37" (1/3) ... [2018-04-11 15:36:37,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfbd8c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:36:37, skipping insertion in model container [2018-04-11 15:36:37,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:36:37" (2/3) ... [2018-04-11 15:36:37,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfbd8c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:36:37, skipping insertion in model container [2018-04-11 15:36:37,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:36:37" (3/3) ... [2018-04-11 15:36:37,921 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-04-11 15:36:37,929 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:36:37,936 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-04-11 15:36:37,970 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:36:37,970 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:36:37,970 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:36:37,971 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:36:37,971 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:36:37,971 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:36:37,971 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:36:37,971 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:36:37,971 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:36:37,971 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:36:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-04-11 15:36:37,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-11 15:36:37,985 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:37,986 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:37,986 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:37,988 INFO L82 PathProgramCache]: Analyzing trace with hash 764612502, now seen corresponding path program 1 times [2018-04-11 15:36:37,990 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:37,990 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:38,021 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:38,021 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:38,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:38,096 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:36:38,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:36:38,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 15:36:38,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-11 15:36:38,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-11 15:36:38,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 15:36:38,114 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-04-11 15:36:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:38,130 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-04-11 15:36:38,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-11 15:36:38,131 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-04-11 15:36:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:38,141 INFO L225 Difference]: With dead ends: 78 [2018-04-11 15:36:38,141 INFO L226 Difference]: Without dead ends: 75 [2018-04-11 15:36:38,142 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 15:36:38,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-11 15:36:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-11 15:36:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-11 15:36:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2018-04-11 15:36:38,165 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 9 [2018-04-11 15:36:38,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:38,165 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2018-04-11 15:36:38,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-11 15:36:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2018-04-11 15:36:38,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 15:36:38,166 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:38,166 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:38,166 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2144181541, now seen corresponding path program 1 times [2018-04-11 15:36:38,166 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:38,166 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:38,167 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:38,167 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:38,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:38,202 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:36:38,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:36:38,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:36:38,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:36:38,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:36:38,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:36:38,206 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 3 states. [2018-04-11 15:36:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:38,218 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-04-11 15:36:38,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:36:38,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-11 15:36:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:38,220 INFO L225 Difference]: With dead ends: 76 [2018-04-11 15:36:38,220 INFO L226 Difference]: Without dead ends: 76 [2018-04-11 15:36:38,220 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:36:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-04-11 15:36:38,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-04-11 15:36:38,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-11 15:36:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2018-04-11 15:36:38,224 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 12 [2018-04-11 15:36:38,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:38,225 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2018-04-11 15:36:38,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:36:38,225 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2018-04-11 15:36:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 15:36:38,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:38,225 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:38,225 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:38,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2142334499, now seen corresponding path program 1 times [2018-04-11 15:36:38,225 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:38,225 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:38,226 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:38,226 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:38,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:38,300 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:36:38,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:36:38,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:36:38,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:36:38,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:36:38,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:36:38,301 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 3 states. [2018-04-11 15:36:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:38,326 INFO L93 Difference]: Finished difference Result 134 states and 169 transitions. [2018-04-11 15:36:38,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:36:38,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-11 15:36:38,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:38,328 INFO L225 Difference]: With dead ends: 134 [2018-04-11 15:36:38,328 INFO L226 Difference]: Without dead ends: 134 [2018-04-11 15:36:38,328 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:36:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-11 15:36:38,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2018-04-11 15:36:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 15:36:38,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2018-04-11 15:36:38,340 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 12 [2018-04-11 15:36:38,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:38,340 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2018-04-11 15:36:38,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:36:38,340 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2018-04-11 15:36:38,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:36:38,341 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:38,341 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:38,341 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:38,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1987861526, now seen corresponding path program 1 times [2018-04-11 15:36:38,341 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:38,341 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:38,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:38,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:38,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:38,376 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:36:38,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:36:38,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 15:36:38,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:36:38,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:36:38,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:36:38,377 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand 3 states. [2018-04-11 15:36:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:38,437 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2018-04-11 15:36:38,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:36:38,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-04-11 15:36:38,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:38,439 INFO L225 Difference]: With dead ends: 151 [2018-04-11 15:36:38,439 INFO L226 Difference]: Without dead ends: 147 [2018-04-11 15:36:38,440 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:36:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-11 15:36:38,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2018-04-11 15:36:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-11 15:36:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2018-04-11 15:36:38,450 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 194 transitions. Word has length 13 [2018-04-11 15:36:38,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:38,451 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 194 transitions. [2018-04-11 15:36:38,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:36:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 194 transitions. [2018-04-11 15:36:38,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 15:36:38,452 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:38,452 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:38,452 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:38,452 INFO L82 PathProgramCache]: Analyzing trace with hash -990934181, now seen corresponding path program 1 times [2018-04-11 15:36:38,452 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:38,452 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:38,453 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:38,453 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:38,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:38,505 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:36:38,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:36:38,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:36:38,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:36:38,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:36:38,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:36:38,505 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. Second operand 5 states. [2018-04-11 15:36:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:38,555 INFO L93 Difference]: Finished difference Result 259 states and 361 transitions. [2018-04-11 15:36:38,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:36:38,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 15:36:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:38,558 INFO L225 Difference]: With dead ends: 259 [2018-04-11 15:36:38,558 INFO L226 Difference]: Without dead ends: 259 [2018-04-11 15:36:38,558 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:36:38,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-11 15:36:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 228. [2018-04-11 15:36:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-11 15:36:38,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 340 transitions. [2018-04-11 15:36:38,572 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 340 transitions. Word has length 15 [2018-04-11 15:36:38,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:38,573 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 340 transitions. [2018-04-11 15:36:38,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:36:38,573 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 340 transitions. [2018-04-11 15:36:38,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 15:36:38,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:38,573 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:38,574 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:38,574 INFO L82 PathProgramCache]: Analyzing trace with hash -654467540, now seen corresponding path program 1 times [2018-04-11 15:36:38,574 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:38,574 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:38,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:38,575 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:38,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:38,627 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:36:38,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:36:38,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:36:38,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:36:38,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:36:38,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:36:38,628 INFO L87 Difference]: Start difference. First operand 228 states and 340 transitions. Second operand 4 states. [2018-04-11 15:36:38,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:38,707 INFO L93 Difference]: Finished difference Result 390 states and 573 transitions. [2018-04-11 15:36:38,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:36:38,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 15:36:38,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:38,710 INFO L225 Difference]: With dead ends: 390 [2018-04-11 15:36:38,710 INFO L226 Difference]: Without dead ends: 390 [2018-04-11 15:36:38,710 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:36:38,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-04-11 15:36:38,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 360. [2018-04-11 15:36:38,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-04-11 15:36:38,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 550 transitions. [2018-04-11 15:36:38,727 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 550 transitions. Word has length 16 [2018-04-11 15:36:38,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:38,727 INFO L459 AbstractCegarLoop]: Abstraction has 360 states and 550 transitions. [2018-04-11 15:36:38,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:36:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 550 transitions. [2018-04-11 15:36:38,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 15:36:38,728 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:38,728 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:38,728 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:38,729 INFO L82 PathProgramCache]: Analyzing trace with hash -654467539, now seen corresponding path program 1 times [2018-04-11 15:36:38,729 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:38,729 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:38,729 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:38,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:38,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:38,764 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:36:38,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:36:38,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:36:38,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:36:38,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:36:38,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:36:38,765 INFO L87 Difference]: Start difference. First operand 360 states and 550 transitions. Second operand 4 states. [2018-04-11 15:36:38,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:38,868 INFO L93 Difference]: Finished difference Result 489 states and 720 transitions. [2018-04-11 15:36:38,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:36:38,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 15:36:38,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:38,872 INFO L225 Difference]: With dead ends: 489 [2018-04-11 15:36:38,872 INFO L226 Difference]: Without dead ends: 489 [2018-04-11 15:36:38,872 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:36:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-04-11 15:36:38,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 462. [2018-04-11 15:36:38,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-04-11 15:36:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 698 transitions. [2018-04-11 15:36:38,885 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 698 transitions. Word has length 16 [2018-04-11 15:36:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:38,885 INFO L459 AbstractCegarLoop]: Abstraction has 462 states and 698 transitions. [2018-04-11 15:36:38,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:36:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 698 transitions. [2018-04-11 15:36:38,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 15:36:38,886 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:38,886 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:38,886 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:38,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2111148230, now seen corresponding path program 1 times [2018-04-11 15:36:38,887 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:38,887 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:38,888 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:38,888 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:38,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:38,927 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:36:38,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:36:38,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:36:38,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:36:38,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:36:38,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:36:38,928 INFO L87 Difference]: Start difference. First operand 462 states and 698 transitions. Second operand 5 states. [2018-04-11 15:36:38,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:38,973 INFO L93 Difference]: Finished difference Result 865 states and 1229 transitions. [2018-04-11 15:36:38,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:36:38,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-11 15:36:38,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:38,976 INFO L225 Difference]: With dead ends: 865 [2018-04-11 15:36:38,976 INFO L226 Difference]: Without dead ends: 865 [2018-04-11 15:36:38,976 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:36:38,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-04-11 15:36:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 830. [2018-04-11 15:36:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-04-11 15:36:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1198 transitions. [2018-04-11 15:36:38,995 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1198 transitions. Word has length 16 [2018-04-11 15:36:38,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:38,996 INFO L459 AbstractCegarLoop]: Abstraction has 830 states and 1198 transitions. [2018-04-11 15:36:38,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:36:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1198 transitions. [2018-04-11 15:36:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:36:38,996 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:38,997 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:38,997 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:38,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1464034702, now seen corresponding path program 1 times [2018-04-11 15:36:38,997 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:38,997 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:38,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:38,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:38,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:39,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:36:39,035 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:39,035 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:39,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:39,080 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:36:39,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:39,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-04-11 15:36:39,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:36:39,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:36:39,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:36:39,113 INFO L87 Difference]: Start difference. First operand 830 states and 1198 transitions. Second operand 6 states. [2018-04-11 15:36:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:39,214 INFO L93 Difference]: Finished difference Result 1293 states and 1813 transitions. [2018-04-11 15:36:39,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:36:39,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 15:36:39,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:39,223 INFO L225 Difference]: With dead ends: 1293 [2018-04-11 15:36:39,224 INFO L226 Difference]: Without dead ends: 1293 [2018-04-11 15:36:39,224 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:36:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2018-04-11 15:36:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1222. [2018-04-11 15:36:39,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-04-11 15:36:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1746 transitions. [2018-04-11 15:36:39,258 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1746 transitions. Word has length 26 [2018-04-11 15:36:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:39,259 INFO L459 AbstractCegarLoop]: Abstraction has 1222 states and 1746 transitions. [2018-04-11 15:36:39,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:36:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1746 transitions. [2018-04-11 15:36:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 15:36:39,260 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:39,260 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:39,260 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:39,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1396165131, now seen corresponding path program 1 times [2018-04-11 15:36:39,260 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:39,260 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:39,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:39,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:39,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:39,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:36:39,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:36:39,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:36:39,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:36:39,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:36:39,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:36:39,302 INFO L87 Difference]: Start difference. First operand 1222 states and 1746 transitions. Second operand 5 states. [2018-04-11 15:36:39,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:39,365 INFO L93 Difference]: Finished difference Result 1826 states and 2685 transitions. [2018-04-11 15:36:39,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:36:39,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-04-11 15:36:39,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:39,374 INFO L225 Difference]: With dead ends: 1826 [2018-04-11 15:36:39,375 INFO L226 Difference]: Without dead ends: 1826 [2018-04-11 15:36:39,375 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:36:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2018-04-11 15:36:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1804. [2018-04-11 15:36:39,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2018-04-11 15:36:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2673 transitions. [2018-04-11 15:36:39,424 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2673 transitions. Word has length 27 [2018-04-11 15:36:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:39,424 INFO L459 AbstractCegarLoop]: Abstraction has 1804 states and 2673 transitions. [2018-04-11 15:36:39,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:36:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2673 transitions. [2018-04-11 15:36:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 15:36:39,426 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:39,426 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:39,427 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:39,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1008277157, now seen corresponding path program 1 times [2018-04-11 15:36:39,427 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:39,427 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:39,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:39,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:39,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:39,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:36:39,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:39,515 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:39,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:39,534 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:36:39,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:36:39,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-04-11 15:36:39,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:36:39,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:36:39,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:36:39,582 INFO L87 Difference]: Start difference. First operand 1804 states and 2673 transitions. Second operand 11 states. [2018-04-11 15:36:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:40,086 INFO L93 Difference]: Finished difference Result 956 states and 1213 transitions. [2018-04-11 15:36:40,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:36:40,087 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-04-11 15:36:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:40,089 INFO L225 Difference]: With dead ends: 956 [2018-04-11 15:36:40,089 INFO L226 Difference]: Without dead ends: 860 [2018-04-11 15:36:40,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:36:40,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2018-04-11 15:36:40,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 797. [2018-04-11 15:36:40,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-04-11 15:36:40,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1060 transitions. [2018-04-11 15:36:40,108 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1060 transitions. Word has length 31 [2018-04-11 15:36:40,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:40,108 INFO L459 AbstractCegarLoop]: Abstraction has 797 states and 1060 transitions. [2018-04-11 15:36:40,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:36:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1060 transitions. [2018-04-11 15:36:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 15:36:40,109 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:40,109 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:40,109 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:40,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1466399373, now seen corresponding path program 1 times [2018-04-11 15:36:40,110 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:40,110 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:40,111 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:40,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:40,111 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:40,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:36:40,229 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:40,229 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:40,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:40,244 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:36:40,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:36:40,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-04-11 15:36:40,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:36:40,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:36:40,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:36:40,275 INFO L87 Difference]: Start difference. First operand 797 states and 1060 transitions. Second operand 12 states. [2018-04-11 15:36:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:41,004 INFO L93 Difference]: Finished difference Result 1474 states and 1938 transitions. [2018-04-11 15:36:41,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:36:41,005 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-04-11 15:36:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:41,008 INFO L225 Difference]: With dead ends: 1474 [2018-04-11 15:36:41,008 INFO L226 Difference]: Without dead ends: 1466 [2018-04-11 15:36:41,008 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:36:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-04-11 15:36:41,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1122. [2018-04-11 15:36:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2018-04-11 15:36:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1488 transitions. [2018-04-11 15:36:41,044 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1488 transitions. Word has length 31 [2018-04-11 15:36:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:41,044 INFO L459 AbstractCegarLoop]: Abstraction has 1122 states and 1488 transitions. [2018-04-11 15:36:41,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:36:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1488 transitions. [2018-04-11 15:36:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 15:36:41,045 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:41,045 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:41,045 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1776763504, now seen corresponding path program 1 times [2018-04-11 15:36:41,045 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:41,045 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:41,046 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:41,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:41,046 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:41,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-04-11 15:36:41,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:36:41,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:36:41,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:36:41,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:36:41,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:36:41,098 INFO L87 Difference]: Start difference. First operand 1122 states and 1488 transitions. Second operand 4 states. [2018-04-11 15:36:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:41,119 INFO L93 Difference]: Finished difference Result 1131 states and 1500 transitions. [2018-04-11 15:36:41,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:36:41,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-04-11 15:36:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:41,124 INFO L225 Difference]: With dead ends: 1131 [2018-04-11 15:36:41,124 INFO L226 Difference]: Without dead ends: 1131 [2018-04-11 15:36:41,124 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:36:41,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-04-11 15:36:41,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1125. [2018-04-11 15:36:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2018-04-11 15:36:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1491 transitions. [2018-04-11 15:36:41,151 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1491 transitions. Word has length 38 [2018-04-11 15:36:41,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:41,151 INFO L459 AbstractCegarLoop]: Abstraction has 1125 states and 1491 transitions. [2018-04-11 15:36:41,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:36:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1491 transitions. [2018-04-11 15:36:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 15:36:41,152 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:41,152 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:41,152 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:41,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1816603918, now seen corresponding path program 1 times [2018-04-11 15:36:41,153 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:41,153 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:41,153 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:41,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:41,153 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:41,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:36:41,229 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:41,229 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:41,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:41,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:36:41,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:41,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-04-11 15:36:41,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:36:41,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:36:41,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:36:41,303 INFO L87 Difference]: Start difference. First operand 1125 states and 1491 transitions. Second operand 10 states. [2018-04-11 15:36:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:41,726 INFO L93 Difference]: Finished difference Result 2734 states and 3590 transitions. [2018-04-11 15:36:41,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:36:41,727 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-04-11 15:36:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:41,733 INFO L225 Difference]: With dead ends: 2734 [2018-04-11 15:36:41,733 INFO L226 Difference]: Without dead ends: 2734 [2018-04-11 15:36:41,733 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:36:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2018-04-11 15:36:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 2363. [2018-04-11 15:36:41,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2018-04-11 15:36:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3129 transitions. [2018-04-11 15:36:41,769 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3129 transitions. Word has length 38 [2018-04-11 15:36:41,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:41,770 INFO L459 AbstractCegarLoop]: Abstraction has 2363 states and 3129 transitions. [2018-04-11 15:36:41,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:36:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3129 transitions. [2018-04-11 15:36:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 15:36:41,771 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:41,771 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:41,771 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:41,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2142437170, now seen corresponding path program 1 times [2018-04-11 15:36:41,771 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:41,771 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:41,772 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:41,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:41,772 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:41,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:36:41,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:41,838 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:41,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:41,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:36:41,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:41,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-04-11 15:36:41,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:36:41,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:36:41,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:36:41,911 INFO L87 Difference]: Start difference. First operand 2363 states and 3129 transitions. Second operand 10 states. [2018-04-11 15:36:42,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:42,124 INFO L93 Difference]: Finished difference Result 2436 states and 3194 transitions. [2018-04-11 15:36:42,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:36:42,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-04-11 15:36:42,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:42,134 INFO L225 Difference]: With dead ends: 2436 [2018-04-11 15:36:42,134 INFO L226 Difference]: Without dead ends: 2400 [2018-04-11 15:36:42,135 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:36:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2018-04-11 15:36:42,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2327. [2018-04-11 15:36:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2018-04-11 15:36:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 3075 transitions. [2018-04-11 15:36:42,179 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 3075 transitions. Word has length 42 [2018-04-11 15:36:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:42,179 INFO L459 AbstractCegarLoop]: Abstraction has 2327 states and 3075 transitions. [2018-04-11 15:36:42,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:36:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 3075 transitions. [2018-04-11 15:36:42,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 15:36:42,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:42,180 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:42,180 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:42,181 INFO L82 PathProgramCache]: Analyzing trace with hash -211724275, now seen corresponding path program 1 times [2018-04-11 15:36:42,181 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:42,181 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:42,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:42,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:42,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:42,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 15:36:42,294 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:42,294 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:42,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:42,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 15:36:42,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:42,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-04-11 15:36:42,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:36:42,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:36:42,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:36:42,360 INFO L87 Difference]: Start difference. First operand 2327 states and 3075 transitions. Second operand 9 states. [2018-04-11 15:36:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:42,556 INFO L93 Difference]: Finished difference Result 2176 states and 2860 transitions. [2018-04-11 15:36:42,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:36:42,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-04-11 15:36:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:42,563 INFO L225 Difference]: With dead ends: 2176 [2018-04-11 15:36:42,563 INFO L226 Difference]: Without dead ends: 2176 [2018-04-11 15:36:42,563 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:36:42,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2018-04-11 15:36:42,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2118. [2018-04-11 15:36:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2118 states. [2018-04-11 15:36:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 2802 transitions. [2018-04-11 15:36:42,601 INFO L78 Accepts]: Start accepts. Automaton has 2118 states and 2802 transitions. Word has length 43 [2018-04-11 15:36:42,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:42,602 INFO L459 AbstractCegarLoop]: Abstraction has 2118 states and 2802 transitions. [2018-04-11 15:36:42,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:36:42,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 2802 transitions. [2018-04-11 15:36:42,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:36:42,603 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:42,603 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:42,603 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:42,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1766984159, now seen corresponding path program 1 times [2018-04-11 15:36:42,603 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:42,603 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:42,604 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:42,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:42,604 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:42,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 15:36:42,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:42,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:42,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:42,705 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 15:36:42,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:42,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-11 15:36:42,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:36:42,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:36:42,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:36:42,776 INFO L87 Difference]: Start difference. First operand 2118 states and 2802 transitions. Second operand 11 states. [2018-04-11 15:36:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:43,037 INFO L93 Difference]: Finished difference Result 2594 states and 3463 transitions. [2018-04-11 15:36:43,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:36:43,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-04-11 15:36:43,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:43,047 INFO L225 Difference]: With dead ends: 2594 [2018-04-11 15:36:43,047 INFO L226 Difference]: Without dead ends: 2594 [2018-04-11 15:36:43,047 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:36:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2018-04-11 15:36:43,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2510. [2018-04-11 15:36:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2510 states. [2018-04-11 15:36:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 3370 transitions. [2018-04-11 15:36:43,091 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 3370 transitions. Word has length 54 [2018-04-11 15:36:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:43,091 INFO L459 AbstractCegarLoop]: Abstraction has 2510 states and 3370 transitions. [2018-04-11 15:36:43,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:36:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 3370 transitions. [2018-04-11 15:36:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:36:43,092 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:43,093 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:43,093 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:43,093 INFO L82 PathProgramCache]: Analyzing trace with hash -2029376545, now seen corresponding path program 1 times [2018-04-11 15:36:43,093 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:43,093 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:43,094 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:43,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:43,094 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:43,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-11 15:36:43,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:43,155 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:43,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:43,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 15:36:43,216 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:43,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-04-11 15:36:43,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:36:43,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:36:43,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:36:43,217 INFO L87 Difference]: Start difference. First operand 2510 states and 3370 transitions. Second operand 10 states. [2018-04-11 15:36:43,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:43,375 INFO L93 Difference]: Finished difference Result 2578 states and 3412 transitions. [2018-04-11 15:36:43,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:36:43,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-04-11 15:36:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:43,382 INFO L225 Difference]: With dead ends: 2578 [2018-04-11 15:36:43,382 INFO L226 Difference]: Without dead ends: 2476 [2018-04-11 15:36:43,383 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:36:43,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2018-04-11 15:36:43,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2440. [2018-04-11 15:36:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2440 states. [2018-04-11 15:36:43,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3236 transitions. [2018-04-11 15:36:43,426 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3236 transitions. Word has length 54 [2018-04-11 15:36:43,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:43,427 INFO L459 AbstractCegarLoop]: Abstraction has 2440 states and 3236 transitions. [2018-04-11 15:36:43,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:36:43,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3236 transitions. [2018-04-11 15:36:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 15:36:43,428 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:43,428 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:43,429 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:43,429 INFO L82 PathProgramCache]: Analyzing trace with hash 473555497, now seen corresponding path program 1 times [2018-04-11 15:36:43,429 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:43,429 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:43,430 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:43,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:43,430 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:43,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 15:36:43,579 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:43,579 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:43,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:43,604 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 15:36:43,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:43,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-04-11 15:36:43,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:36:43,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:36:43,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:36:43,675 INFO L87 Difference]: Start difference. First operand 2440 states and 3236 transitions. Second operand 13 states. [2018-04-11 15:36:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:43,992 INFO L93 Difference]: Finished difference Result 2350 states and 3062 transitions. [2018-04-11 15:36:43,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:36:43,993 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-04-11 15:36:43,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:44,000 INFO L225 Difference]: With dead ends: 2350 [2018-04-11 15:36:44,000 INFO L226 Difference]: Without dead ends: 2283 [2018-04-11 15:36:44,000 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:36:44,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2018-04-11 15:36:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 1680. [2018-04-11 15:36:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2018-04-11 15:36:44,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2193 transitions. [2018-04-11 15:36:44,036 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2193 transitions. Word has length 57 [2018-04-11 15:36:44,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:44,036 INFO L459 AbstractCegarLoop]: Abstraction has 1680 states and 2193 transitions. [2018-04-11 15:36:44,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:36:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2193 transitions. [2018-04-11 15:36:44,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 15:36:44,037 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:44,037 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:44,037 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:44,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2017153842, now seen corresponding path program 1 times [2018-04-11 15:36:44,037 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:44,037 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:44,038 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:44,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:44,038 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:44,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:36:44,161 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 15:36:44,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:44,162 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:44,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:44,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 15:36:44,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:44,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-04-11 15:36:44,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:36:44,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:36:44,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:36:44,254 INFO L87 Difference]: Start difference. First operand 1680 states and 2193 transitions. Second operand 12 states. [2018-04-11 15:36:44,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:44,577 INFO L93 Difference]: Finished difference Result 2191 states and 2966 transitions. [2018-04-11 15:36:44,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:36:44,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-04-11 15:36:44,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:44,585 INFO L225 Difference]: With dead ends: 2191 [2018-04-11 15:36:44,585 INFO L226 Difference]: Without dead ends: 2191 [2018-04-11 15:36:44,585 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:36:44,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2018-04-11 15:36:44,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 1680. [2018-04-11 15:36:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2018-04-11 15:36:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2193 transitions. [2018-04-11 15:36:44,621 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2193 transitions. Word has length 58 [2018-04-11 15:36:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:44,621 INFO L459 AbstractCegarLoop]: Abstraction has 1680 states and 2193 transitions. [2018-04-11 15:36:44,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:36:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2193 transitions. [2018-04-11 15:36:44,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 15:36:44,622 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:44,622 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:44,622 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:44,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1953024946, now seen corresponding path program 1 times [2018-04-11 15:36:44,623 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:44,623 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:44,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:44,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:44,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:44,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 51 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-11 15:36:44,704 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:44,704 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:44,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:44,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 51 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-11 15:36:44,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:44,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-11 15:36:44,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:36:44,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:36:44,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:36:44,766 INFO L87 Difference]: Start difference. First operand 1680 states and 2193 transitions. Second operand 11 states. [2018-04-11 15:36:45,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:45,020 INFO L93 Difference]: Finished difference Result 2217 states and 3031 transitions. [2018-04-11 15:36:45,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:36:45,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-04-11 15:36:45,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:45,025 INFO L225 Difference]: With dead ends: 2217 [2018-04-11 15:36:45,025 INFO L226 Difference]: Without dead ends: 2217 [2018-04-11 15:36:45,026 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:36:45,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2018-04-11 15:36:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 1680. [2018-04-11 15:36:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2018-04-11 15:36:45,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2193 transitions. [2018-04-11 15:36:45,050 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2193 transitions. Word has length 66 [2018-04-11 15:36:45,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:45,051 INFO L459 AbstractCegarLoop]: Abstraction has 1680 states and 2193 transitions. [2018-04-11 15:36:45,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:36:45,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2193 transitions. [2018-04-11 15:36:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 15:36:45,051 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:45,052 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:45,052 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:45,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1759935924, now seen corresponding path program 1 times [2018-04-11 15:36:45,052 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:45,052 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:45,053 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:45,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:45,053 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:45,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-04-11 15:36:45,129 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:45,129 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:45,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:45,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-04-11 15:36:45,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:45,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-11 15:36:45,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:36:45,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:36:45,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:36:45,191 INFO L87 Difference]: Start difference. First operand 1680 states and 2193 transitions. Second operand 11 states. [2018-04-11 15:36:45,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:45,464 INFO L93 Difference]: Finished difference Result 1972 states and 2612 transitions. [2018-04-11 15:36:45,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:36:45,465 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-04-11 15:36:45,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:45,472 INFO L225 Difference]: With dead ends: 1972 [2018-04-11 15:36:45,472 INFO L226 Difference]: Without dead ends: 1972 [2018-04-11 15:36:45,472 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:36:45,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2018-04-11 15:36:45,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1951. [2018-04-11 15:36:45,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1951 states. [2018-04-11 15:36:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 2595 transitions. [2018-04-11 15:36:45,504 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 2595 transitions. Word has length 68 [2018-04-11 15:36:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:45,504 INFO L459 AbstractCegarLoop]: Abstraction has 1951 states and 2595 transitions. [2018-04-11 15:36:45,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:36:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2595 transitions. [2018-04-11 15:36:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 15:36:45,505 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:45,506 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:45,506 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:45,506 INFO L82 PathProgramCache]: Analyzing trace with hash -351130211, now seen corresponding path program 1 times [2018-04-11 15:36:45,506 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:45,506 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:45,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:45,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:45,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:45,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-11 15:36:45,578 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:45,579 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:45,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:45,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-11 15:36:45,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:45,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-11 15:36:45,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:36:45,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:36:45,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:36:45,639 INFO L87 Difference]: Start difference. First operand 1951 states and 2595 transitions. Second operand 11 states. [2018-04-11 15:36:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:45,833 INFO L93 Difference]: Finished difference Result 2422 states and 3359 transitions. [2018-04-11 15:36:45,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:36:45,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-04-11 15:36:45,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:45,839 INFO L225 Difference]: With dead ends: 2422 [2018-04-11 15:36:45,839 INFO L226 Difference]: Without dead ends: 2418 [2018-04-11 15:36:45,840 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:36:45,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2018-04-11 15:36:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 1907. [2018-04-11 15:36:45,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2018-04-11 15:36:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2536 transitions. [2018-04-11 15:36:45,877 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2536 transitions. Word has length 72 [2018-04-11 15:36:45,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:45,878 INFO L459 AbstractCegarLoop]: Abstraction has 1907 states and 2536 transitions. [2018-04-11 15:36:45,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:36:45,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2536 transitions. [2018-04-11 15:36:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 15:36:45,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:45,879 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:45,879 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:45,880 INFO L82 PathProgramCache]: Analyzing trace with hash -638982733, now seen corresponding path program 1 times [2018-04-11 15:36:45,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:45,880 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:45,881 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:45,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:45,881 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:45,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 50 proven. 23 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-04-11 15:36:46,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:46,039 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:46,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:46,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 71 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-04-11 15:36:46,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:46,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-04-11 15:36:46,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:36:46,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:36:46,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:36:46,141 INFO L87 Difference]: Start difference. First operand 1907 states and 2536 transitions. Second operand 13 states. [2018-04-11 15:36:46,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:46,476 INFO L93 Difference]: Finished difference Result 2416 states and 3266 transitions. [2018-04-11 15:36:46,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:36:46,477 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2018-04-11 15:36:46,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:46,481 INFO L225 Difference]: With dead ends: 2416 [2018-04-11 15:36:46,481 INFO L226 Difference]: Without dead ends: 2416 [2018-04-11 15:36:46,481 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:36:46,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2018-04-11 15:36:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2152. [2018-04-11 15:36:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-04-11 15:36:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2890 transitions. [2018-04-11 15:36:46,525 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2890 transitions. Word has length 73 [2018-04-11 15:36:46,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:46,526 INFO L459 AbstractCegarLoop]: Abstraction has 2152 states and 2890 transitions. [2018-04-11 15:36:46,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:36:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2890 transitions. [2018-04-11 15:36:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-11 15:36:46,527 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:46,527 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:46,527 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:46,528 INFO L82 PathProgramCache]: Analyzing trace with hash 623126807, now seen corresponding path program 1 times [2018-04-11 15:36:46,528 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:46,528 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:46,528 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:46,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:46,528 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:46,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-04-11 15:36:46,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:46,610 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:46,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:46,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 98 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-04-11 15:36:46,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:46,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-11 15:36:46,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:36:46,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:36:46,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:36:46,673 INFO L87 Difference]: Start difference. First operand 2152 states and 2890 transitions. Second operand 11 states. [2018-04-11 15:36:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:46,888 INFO L93 Difference]: Finished difference Result 2416 states and 3279 transitions. [2018-04-11 15:36:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:36:46,921 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2018-04-11 15:36:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:46,927 INFO L225 Difference]: With dead ends: 2416 [2018-04-11 15:36:46,927 INFO L226 Difference]: Without dead ends: 2416 [2018-04-11 15:36:46,927 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:36:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2018-04-11 15:36:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2152. [2018-04-11 15:36:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-04-11 15:36:46,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2890 transitions. [2018-04-11 15:36:46,967 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2890 transitions. Word has length 81 [2018-04-11 15:36:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:46,967 INFO L459 AbstractCegarLoop]: Abstraction has 2152 states and 2890 transitions. [2018-04-11 15:36:46,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:36:46,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2890 transitions. [2018-04-11 15:36:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-11 15:36:46,969 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:46,969 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:46,969 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:46,969 INFO L82 PathProgramCache]: Analyzing trace with hash 523995112, now seen corresponding path program 1 times [2018-04-11 15:36:46,969 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:46,969 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:46,970 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:46,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:46,970 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:46,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:36:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-04-11 15:36:47,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:36:47,124 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:36:47,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:36:47,152 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:36:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 107 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-04-11 15:36:47,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:36:47,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-04-11 15:36:47,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:36:47,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:36:47,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:36:47,216 INFO L87 Difference]: Start difference. First operand 2152 states and 2890 transitions. Second operand 13 states. [2018-04-11 15:36:47,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:36:47,615 INFO L93 Difference]: Finished difference Result 2661 states and 3605 transitions. [2018-04-11 15:36:47,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:36:47,615 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2018-04-11 15:36:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:36:47,621 INFO L225 Difference]: With dead ends: 2661 [2018-04-11 15:36:47,621 INFO L226 Difference]: Without dead ends: 2661 [2018-04-11 15:36:47,622 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:36:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2018-04-11 15:36:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2152. [2018-04-11 15:36:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-04-11 15:36:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2866 transitions. [2018-04-11 15:36:47,666 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2866 transitions. Word has length 87 [2018-04-11 15:36:47,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:36:47,666 INFO L459 AbstractCegarLoop]: Abstraction has 2152 states and 2866 transitions. [2018-04-11 15:36:47,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:36:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2866 transitions. [2018-04-11 15:36:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-11 15:36:47,668 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:36:47,669 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:36:47,669 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 15:36:47,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1015411636, now seen corresponding path program 1 times [2018-04-11 15:36:47,669 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:36:47,669 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:36:47,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:47,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:36:47,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:36:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 15:36:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 15:36:47,741 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-11 15:36:47,802 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-04-11 15:36:47,811 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,812 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,812 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,813 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,814 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,815 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,818 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,818 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,819 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,820 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,822 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,823 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,824 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,824 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,827 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,827 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,828 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,828 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,829 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,829 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,832 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,832 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,833 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,833 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,834 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,834 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,835 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,836 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,837 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,837 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,838 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,838 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,838 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,839 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 15:36:47,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:36:47 BoogieIcfgContainer [2018-04-11 15:36:47,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:36:47,854 INFO L168 Benchmark]: Toolchain (without parser) took 10642.30 ms. Allocated memory was 399.5 MB in the beginning and 963.6 MB in the end (delta: 564.1 MB). Free memory was 329.3 MB in the beginning and 414.4 MB in the end (delta: -85.2 MB). Peak memory consumption was 479.0 MB. Max. memory is 5.3 GB. [2018-04-11 15:36:47,855 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 399.5 MB. Free memory is still 359.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:36:47,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.74 ms. Allocated memory is still 399.5 MB. Free memory was 329.3 MB in the beginning and 304.1 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-11 15:36:47,855 INFO L168 Benchmark]: Boogie Preprocessor took 40.21 ms. Allocated memory is still 399.5 MB. Free memory was 304.1 MB in the beginning and 300.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-04-11 15:36:47,856 INFO L168 Benchmark]: RCFGBuilder took 423.50 ms. Allocated memory was 399.5 MB in the beginning and 607.1 MB in the end (delta: 207.6 MB). Free memory was 300.2 MB in the beginning and 534.5 MB in the end (delta: -234.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. [2018-04-11 15:36:47,856 INFO L168 Benchmark]: TraceAbstraction took 9938.04 ms. Allocated memory was 607.1 MB in the beginning and 963.6 MB in the end (delta: 356.5 MB). Free memory was 534.5 MB in the beginning and 414.4 MB in the end (delta: 120.1 MB). Peak memory consumption was 476.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:36:47,857 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.28 ms. Allocated memory is still 399.5 MB. Free memory is still 359.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 237.74 ms. Allocated memory is still 399.5 MB. Free memory was 329.3 MB in the beginning and 304.1 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.21 ms. Allocated memory is still 399.5 MB. Free memory was 304.1 MB in the beginning and 300.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 423.50 ms. Allocated memory was 399.5 MB in the beginning and 607.1 MB in the end (delta: 207.6 MB). Free memory was 300.2 MB in the beginning and 534.5 MB in the end (delta: -234.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9938.04 ms. Allocated memory was 607.1 MB in the beginning and 963.6 MB in the end (delta: 356.5 MB). Free memory was 534.5 MB in the beginning and 414.4 MB in the end (delta: 120.1 MB). Peak memory consumption was 476.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 688]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=17, \old(garbage)=23, \old(pc1)=26, \old(pc4)=16, \old(res4)=15, \old(S)=25, \old(S)=12, \old(t1)=24, \old(t1)=22, \old(t4)=18, \old(t4)=13, \old(x1)=14, \old(x1)=20, \old(x4)=11, \old(x4)=21, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L632] COND TRUE case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] EXPR, FCALL malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={10:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] x1 = malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={10:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L634] FCALL x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={10:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L635] RET, FCALL x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={10:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L632] COND FALSE !(case 1:) [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L637] COND TRUE case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L638] RET, FCALL x1->data = 4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L632] COND FALSE !(case 1:) [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L637] COND FALSE !(case 2:) [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L640] COND TRUE case 3: [L641] RET t1 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L632] COND FALSE !(case 1:) [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L637] COND FALSE !(case 2:) [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L640] COND FALSE !(case 3:) [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L643] COND TRUE case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L644] RET, FCALL x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L632] COND FALSE !(case 1:) [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L637] COND FALSE !(case 2:) [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L640] COND FALSE !(case 3:) [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L643] COND FALSE !(case 4:) [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L646] COND TRUE case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L647] COND TRUE S == t1 [L648] RET S = x1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L632] COND FALSE !(case 1:) [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L637] COND FALSE !(case 2:) [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L640] COND FALSE !(case 3:) [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L643] COND FALSE !(case 4:) [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L646] COND FALSE !(case 5:) [L652] case 6: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L652] COND TRUE case 6: [L653] RET pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L696] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L701] S = ((void *)0) [L702] t1 = ((void *)0) [L703] x1 = ((void *)0) [L704] t4 = ((void *)0) [L705] x4 = ((void *)0) [L706] return !!garbage; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, \result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 78 locations, 19 error locations. UNSAFE Result, 9.8s OverallTime, 27 OverallIterations, 7 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2408 SDtfs, 4706 SDslu, 5223 SDs, 0 SdLazy, 4993 SolverSat, 711 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1246 GetRequests, 914 SyntacticMatches, 33 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2510occurred in iteration=17, 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.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 4499 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2031 NumberOfCodeBlocks, 2031 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1894 ConstructedInterpolants, 0 QuantifiedInterpolants, 277310 SizeOfPredicates, 57 NumberOfNonLiveVariables, 6860 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 42 InterpolantComputations, 12 PerfectInterpolantSequences, 1622/1851 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-36-47-863.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-36-47-863.csv Received shutdown request...