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.3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 05:32:48,382 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 05:32:48,384 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 05:32:48,397 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 05:32:48,397 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 05:32:48,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 05:32:48,399 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 05:32:48,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 05:32:48,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 05:32:48,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 05:32:48,404 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 05:32:48,404 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 05:32:48,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 05:32:48,405 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 05:32:48,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 05:32:48,408 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 05:32:48,409 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 05:32:48,410 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 05:32:48,411 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 05:32:48,412 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 05:32:48,414 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 05:32:48,414 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 05:32:48,414 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 05:32:48,415 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 05:32:48,415 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 05:32:48,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 05:32:48,416 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 05:32:48,417 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 05:32:48,418 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 05:32:48,418 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 05:32:48,418 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 05:32:48,418 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-13 05:32:48,428 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 05:32:48,428 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 05:32:48,429 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 05:32:48,429 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 05:32:48,429 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 05:32:48,429 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 05:32:48,430 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 05:32:48,430 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 05:32:48,430 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 05:32:48,430 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 05:32:48,430 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 05:32:48,430 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 05:32:48,430 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 05:32:48,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 05:32:48,431 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 05:32:48,431 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 05:32:48,431 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 05:32:48,431 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 05:32:48,431 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 05:32:48,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 05:32:48,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 05:32:48,432 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 05:32:48,432 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 05:32:48,432 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 05:32:48,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 05:32:48,468 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 05:32:48,471 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 05:32:48,473 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 05:32:48,473 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 05:32:48,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,760 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG10ce7d12f [2018-04-13 05:32:48,896 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 05:32:48,897 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 05:32:48,898 INFO L168 CDTParser]: Scanning lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,907 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 05:32:48,908 INFO L215 ultiparseSymbolTable]: [2018-04-13 05:32:48,908 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 05:32:48,908 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flockfree_____false_valid_memtrack_i__pop ('pop') in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,908 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,908 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flockfree_____false_valid_memtrack_i__push ('push') in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,908 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 05:32:48,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____mode_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____intptr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ssize_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__size_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____time_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int8_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsfilcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_mutexattr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____timer_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int8_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int32_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__mode_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__timer_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____nlink_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__caddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_short in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__gid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pc4 in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ssize_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blkcnt64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__key_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fd_set in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsfilcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_short in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int32_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pc1 in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int16_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____id_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____sig_atomic_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_char in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____off64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fd_mask in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int8_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint32_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__x4 in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_once_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__x1 in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsblkcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__blksize_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____clockid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__div_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_long in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____pthread_list_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_cond_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsblkcnt64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int16_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__blkcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__quad_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__garbage in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____suseconds_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_char in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__off_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__uid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____socklen_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__lldiv_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____rlim_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__wchar_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_attr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ino64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_long in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____off_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_barrier_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_quad_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ushort in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____quad_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__daddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____sigset_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____pid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int16_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint16_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ino_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____WAIT_STATUS in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____gid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_spinlock_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____clock_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ulong in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__clockid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int32_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____loff_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fd_mask in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__suseconds_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_rwlockattr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,917 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____caddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,917 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__clock_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,917 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_key_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,917 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,917 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____dev_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,917 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsblkcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,917 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,917 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_quad_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,917 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__uint in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,917 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__nlink_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,917 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_rwlock_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,917 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__loff_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,917 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__id_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,918 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_condattr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,918 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__t1 in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,918 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____rlim64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,918 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__dev_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,918 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__sigset_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,918 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____qaddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,918 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blksize_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,918 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__t4 in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,918 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__register_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,918 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____daddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,918 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_barrierattr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,918 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blkcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,919 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____key_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,919 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_int in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,919 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__S in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,919 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint8_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,919 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__time_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,919 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____useconds_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,919 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_mutex_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,919 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ino_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,919 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ldiv_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,919 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____swblk_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,919 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsfilcnt64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:48,935 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG10ce7d12f [2018-04-13 05:32:48,938 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 05:32:48,939 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 05:32:48,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 05:32:48,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 05:32:48,943 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 05:32:48,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:32:48" (1/1) ... [2018-04-13 05:32:48,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4388ffc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:48, skipping insertion in model container [2018-04-13 05:32:48,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:32:48" (1/1) ... [2018-04-13 05:32:48,956 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 05:32:48,979 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 05:32:49,103 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 05:32:49,139 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 05:32:49,146 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-13 05:32:49,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:49 WrapperNode [2018-04-13 05:32:49,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 05:32:49,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 05:32:49,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 05:32:49,184 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 05:32:49,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:49" (1/1) ... [2018-04-13 05:32:49,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:49" (1/1) ... [2018-04-13 05:32:49,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:49" (1/1) ... [2018-04-13 05:32:49,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:49" (1/1) ... [2018-04-13 05:32:49,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:49" (1/1) ... [2018-04-13 05:32:49,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:49" (1/1) ... [2018-04-13 05:32:49,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:49" (1/1) ... [2018-04-13 05:32:49,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 05:32:49,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 05:32:49,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 05:32:49,228 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 05:32:49,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:49" (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-13 05:32:49,312 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 05:32:49,312 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 05:32:49,313 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-13 05:32:49,313 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-13 05:32:49,313 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 05:32:49,313 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-13 05:32:49,313 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 05:32:49,313 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 05:32:49,313 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 05:32:49,313 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 05:32:49,313 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 05:32:49,313 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 05:32:49,313 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 05:32:49,313 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 05:32:49,313 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 05:32:49,313 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 05:32:49,313 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 05:32:49,314 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 05:32:49,314 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 05:32:49,314 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 05:32:49,314 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 05:32:49,314 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 05:32:49,314 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 05:32:49,314 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 05:32:49,314 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 05:32:49,314 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 05:32:49,314 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 05:32:49,314 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 05:32:49,314 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 05:32:49,314 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 05:32:49,314 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 05:32:49,314 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 05:32:49,314 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 05:32:49,315 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 05:32:49,315 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 05:32:49,315 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 05:32:49,315 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 05:32:49,315 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 05:32:49,315 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 05:32:49,315 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 05:32:49,315 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 05:32:49,315 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 05:32:49,315 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 05:32:49,316 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 05:32:49,316 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 05:32:49,316 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 05:32:49,316 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 05:32:49,316 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 05:32:49,316 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 05:32:49,316 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 05:32:49,316 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 05:32:49,316 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 05:32:49,316 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 05:32:49,317 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 05:32:49,317 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 05:32:49,317 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 05:32:49,317 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 05:32:49,317 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 05:32:49,317 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 05:32:49,317 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 05:32:49,317 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 05:32:49,317 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 05:32:49,317 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 05:32:49,318 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 05:32:49,318 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 05:32:49,318 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 05:32:49,318 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 05:32:49,318 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 05:32:49,318 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 05:32:49,318 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 05:32:49,318 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-13 05:32:49,318 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 05:32:49,318 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 05:32:49,319 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 05:32:49,319 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 05:32:49,319 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 05:32:49,319 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 05:32:49,319 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 05:32:49,319 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 05:32:49,319 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 05:32:49,319 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 05:32:49,319 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 05:32:49,319 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 05:32:49,320 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 05:32:49,320 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 05:32:49,320 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 05:32:49,320 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 05:32:49,320 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 05:32:49,320 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 05:32:49,320 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 05:32:49,320 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 05:32:49,320 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 05:32:49,320 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 05:32:49,321 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 05:32:49,321 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 05:32:49,321 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 05:32:49,321 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 05:32:49,321 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 05:32:49,321 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 05:32:49,321 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 05:32:49,321 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 05:32:49,321 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 05:32:49,321 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 05:32:49,322 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 05:32:49,322 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 05:32:49,322 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 05:32:49,322 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 05:32:49,322 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 05:32:49,322 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-13 05:32:49,322 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 05:32:49,322 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 05:32:49,323 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-13 05:32:49,323 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-13 05:32:49,323 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-13 05:32:49,323 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 05:32:49,323 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 05:32:49,323 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 05:32:49,323 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 05:32:49,323 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 05:32:49,323 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 05:32:49,625 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 05:32:49,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:32:49 BoogieIcfgContainer [2018-04-13 05:32:49,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 05:32:49,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 05:32:49,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 05:32:49,628 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 05:32:49,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:32:48" (1/3) ... [2018-04-13 05:32:49,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ffddd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:32:49, skipping insertion in model container [2018-04-13 05:32:49,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:49" (2/3) ... [2018-04-13 05:32:49,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ffddd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:32:49, skipping insertion in model container [2018-04-13 05:32:49,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:32:49" (3/3) ... [2018-04-13 05:32:49,630 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.3_false-valid-memtrack.i [2018-04-13 05:32:49,635 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 05:32:49,644 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-04-13 05:32:49,677 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 05:32:49,678 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 05:32:49,678 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 05:32:49,678 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 05:32:49,678 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 05:32:49,678 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 05:32:49,678 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 05:32:49,679 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 05:32:49,679 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 05:32:49,679 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 05:32:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-04-13 05:32:49,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-13 05:32:49,698 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:49,699 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:49,699 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-13 05:32:49,703 INFO L82 PathProgramCache]: Analyzing trace with hash 764612502, now seen corresponding path program 1 times [2018-04-13 05:32:49,704 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:49,704 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:49,732 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:49,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:49,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:49,782 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:49,813 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-13 05:32:49,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:49,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 05:32:49,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-13 05:32:49,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-13 05:32:49,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-13 05:32:49,828 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-04-13 05:32:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:49,847 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-04-13 05:32:49,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-13 05:32:49,848 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-04-13 05:32:49,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:49,859 INFO L225 Difference]: With dead ends: 78 [2018-04-13 05:32:49,859 INFO L226 Difference]: Without dead ends: 75 [2018-04-13 05:32:49,860 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-13 05:32:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-13 05:32:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-13 05:32:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-13 05:32:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2018-04-13 05:32:49,884 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 9 [2018-04-13 05:32:49,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:49,884 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2018-04-13 05:32:49,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-13 05:32:49,884 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2018-04-13 05:32:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-13 05:32:49,885 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:49,885 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:49,885 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-13 05:32:49,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2144181541, now seen corresponding path program 1 times [2018-04-13 05:32:49,885 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:49,885 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:49,886 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:49,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:49,886 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:49,900 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:49,924 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-13 05:32:49,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:49,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:32:49,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 05:32:49,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 05:32:49,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 05:32:49,926 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 3 states. [2018-04-13 05:32:49,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:49,939 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-04-13 05:32:49,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 05:32:49,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-13 05:32:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:49,941 INFO L225 Difference]: With dead ends: 76 [2018-04-13 05:32:49,941 INFO L226 Difference]: Without dead ends: 76 [2018-04-13 05:32:49,941 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-13 05:32:49,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-04-13 05:32:49,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-04-13 05:32:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-13 05:32:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2018-04-13 05:32:49,947 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 12 [2018-04-13 05:32:49,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:49,947 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2018-04-13 05:32:49,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 05:32:49,947 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2018-04-13 05:32:49,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-13 05:32:49,947 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:49,947 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:49,947 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-13 05:32:49,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2142334499, now seen corresponding path program 1 times [2018-04-13 05:32:49,948 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:49,948 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:49,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:49,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:49,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:49,961 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:50,013 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-13 05:32:50,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:50,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:32:50,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 05:32:50,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 05:32:50,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 05:32:50,014 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 3 states. [2018-04-13 05:32:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:50,042 INFO L93 Difference]: Finished difference Result 134 states and 169 transitions. [2018-04-13 05:32:50,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 05:32:50,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-13 05:32:50,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:50,044 INFO L225 Difference]: With dead ends: 134 [2018-04-13 05:32:50,044 INFO L226 Difference]: Without dead ends: 134 [2018-04-13 05:32:50,044 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-13 05:32:50,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-13 05:32:50,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2018-04-13 05:32:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-13 05:32:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2018-04-13 05:32:50,052 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 12 [2018-04-13 05:32:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:50,053 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2018-04-13 05:32:50,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 05:32:50,053 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2018-04-13 05:32:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 05:32:50,053 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:50,053 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:50,053 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-13 05:32:50,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1987861526, now seen corresponding path program 1 times [2018-04-13 05:32:50,054 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:50,054 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:50,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:50,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:50,055 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:50,068 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:50,085 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-13 05:32:50,086 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:50,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 05:32:50,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 05:32:50,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 05:32:50,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 05:32:50,086 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand 3 states. [2018-04-13 05:32:50,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:50,131 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2018-04-13 05:32:50,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 05:32:50,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-04-13 05:32:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:50,132 INFO L225 Difference]: With dead ends: 151 [2018-04-13 05:32:50,133 INFO L226 Difference]: Without dead ends: 147 [2018-04-13 05:32:50,133 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-13 05:32:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-13 05:32:50,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2018-04-13 05:32:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-13 05:32:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2018-04-13 05:32:50,141 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 194 transitions. Word has length 13 [2018-04-13 05:32:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:50,141 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 194 transitions. [2018-04-13 05:32:50,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 05:32:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 194 transitions. [2018-04-13 05:32:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-13 05:32:50,142 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:50,142 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:50,142 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-13 05:32:50,142 INFO L82 PathProgramCache]: Analyzing trace with hash -990934181, now seen corresponding path program 1 times [2018-04-13 05:32:50,142 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:50,142 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:50,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:50,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:50,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:50,150 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:50,182 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-13 05:32:50,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:50,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 05:32:50,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 05:32:50,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 05:32:50,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:32:50,183 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. Second operand 5 states. [2018-04-13 05:32:50,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:50,255 INFO L93 Difference]: Finished difference Result 259 states and 361 transitions. [2018-04-13 05:32:50,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 05:32:50,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-13 05:32:50,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:50,258 INFO L225 Difference]: With dead ends: 259 [2018-04-13 05:32:50,258 INFO L226 Difference]: Without dead ends: 259 [2018-04-13 05:32:50,258 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-13 05:32:50,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-13 05:32:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 228. [2018-04-13 05:32:50,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 05:32:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 340 transitions. [2018-04-13 05:32:50,272 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 340 transitions. Word has length 15 [2018-04-13 05:32:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:50,273 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 340 transitions. [2018-04-13 05:32:50,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 05:32:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 340 transitions. [2018-04-13 05:32:50,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 05:32:50,273 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:50,274 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:50,274 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-13 05:32:50,274 INFO L82 PathProgramCache]: Analyzing trace with hash -654467540, now seen corresponding path program 1 times [2018-04-13 05:32:50,274 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:50,274 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:50,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:50,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:50,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:50,285 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:50,305 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-13 05:32:50,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:50,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:32:50,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 05:32:50,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 05:32:50,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 05:32:50,306 INFO L87 Difference]: Start difference. First operand 228 states and 340 transitions. Second operand 4 states. [2018-04-13 05:32:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:50,401 INFO L93 Difference]: Finished difference Result 390 states and 573 transitions. [2018-04-13 05:32:50,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 05:32:50,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-13 05:32:50,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:50,404 INFO L225 Difference]: With dead ends: 390 [2018-04-13 05:32:50,405 INFO L226 Difference]: Without dead ends: 390 [2018-04-13 05:32:50,405 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-13 05:32:50,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-04-13 05:32:50,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 360. [2018-04-13 05:32:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-04-13 05:32:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 550 transitions. [2018-04-13 05:32:50,421 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 550 transitions. Word has length 16 [2018-04-13 05:32:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:50,421 INFO L459 AbstractCegarLoop]: Abstraction has 360 states and 550 transitions. [2018-04-13 05:32:50,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 05:32:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 550 transitions. [2018-04-13 05:32:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 05:32:50,422 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:50,422 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:50,422 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-13 05:32:50,422 INFO L82 PathProgramCache]: Analyzing trace with hash -654467539, now seen corresponding path program 1 times [2018-04-13 05:32:50,422 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:50,423 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:50,423 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:50,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:50,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:50,433 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:50,484 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-13 05:32:50,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:50,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:32:50,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 05:32:50,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 05:32:50,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 05:32:50,485 INFO L87 Difference]: Start difference. First operand 360 states and 550 transitions. Second operand 4 states. [2018-04-13 05:32:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:50,553 INFO L93 Difference]: Finished difference Result 489 states and 720 transitions. [2018-04-13 05:32:50,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 05:32:50,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-13 05:32:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:50,556 INFO L225 Difference]: With dead ends: 489 [2018-04-13 05:32:50,556 INFO L226 Difference]: Without dead ends: 489 [2018-04-13 05:32:50,556 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-13 05:32:50,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-04-13 05:32:50,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 462. [2018-04-13 05:32:50,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-04-13 05:32:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 698 transitions. [2018-04-13 05:32:50,569 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 698 transitions. Word has length 16 [2018-04-13 05:32:50,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:50,570 INFO L459 AbstractCegarLoop]: Abstraction has 462 states and 698 transitions. [2018-04-13 05:32:50,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 05:32:50,570 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 698 transitions. [2018-04-13 05:32:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 05:32:50,570 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:50,570 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:50,571 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-13 05:32:50,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2111148230, now seen corresponding path program 1 times [2018-04-13 05:32:50,571 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:50,571 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:50,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:50,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:50,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:50,580 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:50,605 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-13 05:32:50,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:50,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 05:32:50,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 05:32:50,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 05:32:50,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:32:50,606 INFO L87 Difference]: Start difference. First operand 462 states and 698 transitions. Second operand 5 states. [2018-04-13 05:32:50,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:50,655 INFO L93 Difference]: Finished difference Result 865 states and 1229 transitions. [2018-04-13 05:32:50,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 05:32:50,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-13 05:32:50,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:50,659 INFO L225 Difference]: With dead ends: 865 [2018-04-13 05:32:50,660 INFO L226 Difference]: Without dead ends: 865 [2018-04-13 05:32:50,660 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-13 05:32:50,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-04-13 05:32:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 830. [2018-04-13 05:32:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-04-13 05:32:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1198 transitions. [2018-04-13 05:32:50,684 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1198 transitions. Word has length 16 [2018-04-13 05:32:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:50,684 INFO L459 AbstractCegarLoop]: Abstraction has 830 states and 1198 transitions. [2018-04-13 05:32:50,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 05:32:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1198 transitions. [2018-04-13 05:32:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 05:32:50,685 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:50,685 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-13 05:32:50,685 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-13 05:32:50,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1464034702, now seen corresponding path program 1 times [2018-04-13 05:32:50,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:50,686 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:50,686 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:50,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:50,686 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:50,707 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:50,755 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-13 05:32:50,756 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:50,756 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:50,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:50,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:50,846 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-13 05:32:50,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:50,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-04-13 05:32:50,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 05:32:50,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 05:32:50,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-13 05:32:50,847 INFO L87 Difference]: Start difference. First operand 830 states and 1198 transitions. Second operand 6 states. [2018-04-13 05:32:50,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:50,913 INFO L93 Difference]: Finished difference Result 1293 states and 1813 transitions. [2018-04-13 05:32:50,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 05:32:50,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-13 05:32:50,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:50,918 INFO L225 Difference]: With dead ends: 1293 [2018-04-13 05:32:50,918 INFO L226 Difference]: Without dead ends: 1293 [2018-04-13 05:32:50,919 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-13 05:32:50,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2018-04-13 05:32:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1222. [2018-04-13 05:32:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-04-13 05:32:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1746 transitions. [2018-04-13 05:32:50,945 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1746 transitions. Word has length 26 [2018-04-13 05:32:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:50,945 INFO L459 AbstractCegarLoop]: Abstraction has 1222 states and 1746 transitions. [2018-04-13 05:32:50,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 05:32:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1746 transitions. [2018-04-13 05:32:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-13 05:32:50,946 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:50,946 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-13 05:32:50,946 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-13 05:32:50,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1396165131, now seen corresponding path program 1 times [2018-04-13 05:32:50,947 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:50,947 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:50,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:50,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:50,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:50,957 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:50,977 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-13 05:32:50,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:50,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 05:32:50,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 05:32:50,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 05:32:50,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:32:50,978 INFO L87 Difference]: Start difference. First operand 1222 states and 1746 transitions. Second operand 5 states. [2018-04-13 05:32:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:51,034 INFO L93 Difference]: Finished difference Result 1826 states and 2685 transitions. [2018-04-13 05:32:51,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 05:32:51,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-04-13 05:32:51,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:51,039 INFO L225 Difference]: With dead ends: 1826 [2018-04-13 05:32:51,039 INFO L226 Difference]: Without dead ends: 1826 [2018-04-13 05:32:51,039 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-13 05:32:51,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2018-04-13 05:32:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1804. [2018-04-13 05:32:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2018-04-13 05:32:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2673 transitions. [2018-04-13 05:32:51,070 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2673 transitions. Word has length 27 [2018-04-13 05:32:51,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:51,071 INFO L459 AbstractCegarLoop]: Abstraction has 1804 states and 2673 transitions. [2018-04-13 05:32:51,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 05:32:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2673 transitions. [2018-04-13 05:32:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 05:32:51,071 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:51,072 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-13 05:32:51,072 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-13 05:32:51,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1008277157, now seen corresponding path program 1 times [2018-04-13 05:32:51,072 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:51,072 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:51,073 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:51,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:51,073 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:51,081 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:51,191 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-13 05:32:51,191 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:51,191 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:51,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:51,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:51,258 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-13 05:32:51,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:32:51,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-04-13 05:32:51,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 05:32:51,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 05:32:51,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:32:51,260 INFO L87 Difference]: Start difference. First operand 1804 states and 2673 transitions. Second operand 11 states. [2018-04-13 05:32:51,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:51,877 INFO L93 Difference]: Finished difference Result 956 states and 1213 transitions. [2018-04-13 05:32:51,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 05:32:51,878 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-04-13 05:32:51,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:51,881 INFO L225 Difference]: With dead ends: 956 [2018-04-13 05:32:51,881 INFO L226 Difference]: Without dead ends: 860 [2018-04-13 05:32:51,882 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2018-04-13 05:32:51,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2018-04-13 05:32:51,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 797. [2018-04-13 05:32:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-04-13 05:32:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1060 transitions. [2018-04-13 05:32:51,903 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1060 transitions. Word has length 31 [2018-04-13 05:32:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:51,903 INFO L459 AbstractCegarLoop]: Abstraction has 797 states and 1060 transitions. [2018-04-13 05:32:51,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 05:32:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1060 transitions. [2018-04-13 05:32:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 05:32:51,904 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:51,904 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-13 05:32:51,905 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-13 05:32:51,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1466399373, now seen corresponding path program 1 times [2018-04-13 05:32:51,905 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:51,905 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:51,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:51,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:51,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:51,915 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:52,023 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-13 05:32:52,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:52,023 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:52,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:52,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:52,089 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-13 05:32:52,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:32:52,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-04-13 05:32:52,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 05:32:52,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 05:32:52,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-13 05:32:52,090 INFO L87 Difference]: Start difference. First operand 797 states and 1060 transitions. Second operand 12 states. [2018-04-13 05:32:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:52,857 INFO L93 Difference]: Finished difference Result 1474 states and 1938 transitions. [2018-04-13 05:32:52,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 05:32:52,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-04-13 05:32:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:52,863 INFO L225 Difference]: With dead ends: 1474 [2018-04-13 05:32:52,863 INFO L226 Difference]: Without dead ends: 1466 [2018-04-13 05:32:52,863 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-13 05:32:52,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-04-13 05:32:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1122. [2018-04-13 05:32:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2018-04-13 05:32:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1488 transitions. [2018-04-13 05:32:52,898 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1488 transitions. Word has length 31 [2018-04-13 05:32:52,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:52,898 INFO L459 AbstractCegarLoop]: Abstraction has 1122 states and 1488 transitions. [2018-04-13 05:32:52,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 05:32:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1488 transitions. [2018-04-13 05:32:52,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 05:32:52,899 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:52,899 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-13 05:32:52,899 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-13 05:32:52,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1776763504, now seen corresponding path program 1 times [2018-04-13 05:32:52,899 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:52,899 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:52,900 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:52,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:52,900 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:52,910 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:52,975 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-13 05:32:52,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:52,975 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:52,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:53,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:53,032 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-04-13 05:32:53,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:32:53,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-04-13 05:32:53,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 05:32:53,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 05:32:53,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-04-13 05:32:53,033 INFO L87 Difference]: Start difference. First operand 1122 states and 1488 transitions. Second operand 10 states. [2018-04-13 05:32:53,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:53,566 INFO L93 Difference]: Finished difference Result 2728 states and 3567 transitions. [2018-04-13 05:32:53,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 05:32:53,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-04-13 05:32:53,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:53,577 INFO L225 Difference]: With dead ends: 2728 [2018-04-13 05:32:53,577 INFO L226 Difference]: Without dead ends: 2728 [2018-04-13 05:32:53,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-04-13 05:32:53,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2018-04-13 05:32:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2351. [2018-04-13 05:32:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2018-04-13 05:32:53,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3105 transitions. [2018-04-13 05:32:53,640 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3105 transitions. Word has length 38 [2018-04-13 05:32:53,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:53,640 INFO L459 AbstractCegarLoop]: Abstraction has 2351 states and 3105 transitions. [2018-04-13 05:32:53,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 05:32:53,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3105 transitions. [2018-04-13 05:32:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 05:32:53,641 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:53,641 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-13 05:32:53,641 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-13 05:32:53,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2142437170, now seen corresponding path program 1 times [2018-04-13 05:32:53,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:53,641 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:53,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:53,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:53,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:53,670 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:53,711 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-13 05:32:53,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:53,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:53,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:53,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:53,762 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-13 05:32:53,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:53,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-04-13 05:32:53,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 05:32:53,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 05:32:53,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-13 05:32:53,763 INFO L87 Difference]: Start difference. First operand 2351 states and 3105 transitions. Second operand 10 states. [2018-04-13 05:32:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:53,970 INFO L93 Difference]: Finished difference Result 2424 states and 3170 transitions. [2018-04-13 05:32:53,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 05:32:53,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-04-13 05:32:53,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:53,979 INFO L225 Difference]: With dead ends: 2424 [2018-04-13 05:32:53,979 INFO L226 Difference]: Without dead ends: 2388 [2018-04-13 05:32:53,980 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-13 05:32:53,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2018-04-13 05:32:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2315. [2018-04-13 05:32:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2315 states. [2018-04-13 05:32:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3051 transitions. [2018-04-13 05:32:54,025 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3051 transitions. Word has length 42 [2018-04-13 05:32:54,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:54,026 INFO L459 AbstractCegarLoop]: Abstraction has 2315 states and 3051 transitions. [2018-04-13 05:32:54,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 05:32:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3051 transitions. [2018-04-13 05:32:54,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 05:32:54,027 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:54,027 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:54,027 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-13 05:32:54,027 INFO L82 PathProgramCache]: Analyzing trace with hash 551379917, now seen corresponding path program 1 times [2018-04-13 05:32:54,027 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:54,027 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:54,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:54,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:54,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:54,038 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:54,133 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-13 05:32:54,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:54,134 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:54,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:54,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:32:54,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:54,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-04-13 05:32:54,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 05:32:54,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 05:32:54,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-04-13 05:32:54,226 INFO L87 Difference]: Start difference. First operand 2315 states and 3051 transitions. Second operand 13 states. [2018-04-13 05:32:55,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:55,180 INFO L93 Difference]: Finished difference Result 1850 states and 2389 transitions. [2018-04-13 05:32:55,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 05:32:55,182 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-04-13 05:32:55,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:55,188 INFO L225 Difference]: With dead ends: 1850 [2018-04-13 05:32:55,188 INFO L226 Difference]: Without dead ends: 1790 [2018-04-13 05:32:55,189 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=1051, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 05:32:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2018-04-13 05:32:55,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1652. [2018-04-13 05:32:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2018-04-13 05:32:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2153 transitions. [2018-04-13 05:32:55,224 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2153 transitions. Word has length 43 [2018-04-13 05:32:55,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:55,224 INFO L459 AbstractCegarLoop]: Abstraction has 1652 states and 2153 transitions. [2018-04-13 05:32:55,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 05:32:55,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2153 transitions. [2018-04-13 05:32:55,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 05:32:55,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:55,225 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-13 05:32:55,225 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-13 05:32:55,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1766984159, now seen corresponding path program 1 times [2018-04-13 05:32:55,225 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:55,225 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:55,226 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:55,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:55,226 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:55,239 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:55,286 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-13 05:32:55,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:55,286 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:55,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:55,313 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:55,354 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-13 05:32:55,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:55,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-13 05:32:55,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 05:32:55,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 05:32:55,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:32:55,355 INFO L87 Difference]: Start difference. First operand 1652 states and 2153 transitions. Second operand 11 states. [2018-04-13 05:32:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:55,627 INFO L93 Difference]: Finished difference Result 2052 states and 2705 transitions. [2018-04-13 05:32:55,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 05:32:55,628 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-04-13 05:32:55,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:55,636 INFO L225 Difference]: With dead ends: 2052 [2018-04-13 05:32:55,636 INFO L226 Difference]: Without dead ends: 2052 [2018-04-13 05:32:55,637 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-13 05:32:55,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2018-04-13 05:32:55,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1999. [2018-04-13 05:32:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2018-04-13 05:32:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2656 transitions. [2018-04-13 05:32:55,684 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2656 transitions. Word has length 54 [2018-04-13 05:32:55,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:55,684 INFO L459 AbstractCegarLoop]: Abstraction has 1999 states and 2656 transitions. [2018-04-13 05:32:55,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 05:32:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2656 transitions. [2018-04-13 05:32:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 05:32:55,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:55,686 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-13 05:32:55,686 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-13 05:32:55,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2029376545, now seen corresponding path program 1 times [2018-04-13 05:32:55,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:55,686 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:55,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:55,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:55,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:55,701 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:55,746 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-13 05:32:55,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:55,746 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:55,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:55,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:55,813 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-13 05:32:55,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:55,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-04-13 05:32:55,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 05:32:55,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 05:32:55,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-13 05:32:55,815 INFO L87 Difference]: Start difference. First operand 1999 states and 2656 transitions. Second operand 10 states. [2018-04-13 05:32:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:56,049 INFO L93 Difference]: Finished difference Result 2037 states and 2658 transitions. [2018-04-13 05:32:56,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 05:32:56,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-04-13 05:32:56,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:56,054 INFO L225 Difference]: With dead ends: 2037 [2018-04-13 05:32:56,055 INFO L226 Difference]: Without dead ends: 1943 [2018-04-13 05:32:56,055 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-04-13 05:32:56,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2018-04-13 05:32:56,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1935. [2018-04-13 05:32:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2018-04-13 05:32:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2532 transitions. [2018-04-13 05:32:56,095 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2532 transitions. Word has length 54 [2018-04-13 05:32:56,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:56,095 INFO L459 AbstractCegarLoop]: Abstraction has 1935 states and 2532 transitions. [2018-04-13 05:32:56,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 05:32:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2532 transitions. [2018-04-13 05:32:56,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-13 05:32:56,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:56,096 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-13 05:32:56,096 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-13 05:32:56,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2017153842, now seen corresponding path program 1 times [2018-04-13 05:32:56,097 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:56,097 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:56,097 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:56,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:56,097 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:56,109 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:56,226 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-13 05:32:56,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:56,227 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:56,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:56,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:56,321 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-13 05:32:56,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:56,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-04-13 05:32:56,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 05:32:56,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 05:32:56,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-13 05:32:56,323 INFO L87 Difference]: Start difference. First operand 1935 states and 2532 transitions. Second operand 12 states. [2018-04-13 05:32:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:56,637 INFO L93 Difference]: Finished difference Result 2532 states and 3437 transitions. [2018-04-13 05:32:56,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 05:32:56,637 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-04-13 05:32:56,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:56,648 INFO L225 Difference]: With dead ends: 2532 [2018-04-13 05:32:56,648 INFO L226 Difference]: Without dead ends: 2532 [2018-04-13 05:32:56,648 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-13 05:32:56,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2018-04-13 05:32:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 1935. [2018-04-13 05:32:56,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2018-04-13 05:32:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2532 transitions. [2018-04-13 05:32:56,696 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2532 transitions. Word has length 58 [2018-04-13 05:32:56,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:56,696 INFO L459 AbstractCegarLoop]: Abstraction has 1935 states and 2532 transitions. [2018-04-13 05:32:56,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 05:32:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2532 transitions. [2018-04-13 05:32:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-13 05:32:56,698 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:56,698 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-13 05:32:56,698 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-13 05:32:56,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1953024946, now seen corresponding path program 1 times [2018-04-13 05:32:56,698 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:56,698 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:56,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:56,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:56,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:56,714 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:56,769 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-13 05:32:56,769 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:56,769 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:56,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:56,799 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:56,837 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-13 05:32:56,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:56,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-13 05:32:56,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 05:32:56,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 05:32:56,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:32:56,839 INFO L87 Difference]: Start difference. First operand 1935 states and 2532 transitions. Second operand 11 states. [2018-04-13 05:32:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:57,093 INFO L93 Difference]: Finished difference Result 2562 states and 3512 transitions. [2018-04-13 05:32:57,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 05:32:57,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-04-13 05:32:57,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:57,105 INFO L225 Difference]: With dead ends: 2562 [2018-04-13 05:32:57,105 INFO L226 Difference]: Without dead ends: 2562 [2018-04-13 05:32:57,106 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-13 05:32:57,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2018-04-13 05:32:57,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 1935. [2018-04-13 05:32:57,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2018-04-13 05:32:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2532 transitions. [2018-04-13 05:32:57,155 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2532 transitions. Word has length 66 [2018-04-13 05:32:57,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:57,156 INFO L459 AbstractCegarLoop]: Abstraction has 1935 states and 2532 transitions. [2018-04-13 05:32:57,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 05:32:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2532 transitions. [2018-04-13 05:32:57,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-13 05:32:57,157 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:57,157 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-13 05:32:57,158 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-13 05:32:57,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1759935924, now seen corresponding path program 1 times [2018-04-13 05:32:57,158 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:57,158 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:57,159 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:57,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:57,159 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:57,173 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:57,225 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-13 05:32:57,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:57,225 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:57,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:57,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:57,321 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-13 05:32:57,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:57,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-13 05:32:57,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 05:32:57,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 05:32:57,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:32:57,322 INFO L87 Difference]: Start difference. First operand 1935 states and 2532 transitions. Second operand 11 states. [2018-04-13 05:32:57,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:57,584 INFO L93 Difference]: Finished difference Result 2275 states and 3022 transitions. [2018-04-13 05:32:57,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 05:32:57,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-04-13 05:32:57,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:57,594 INFO L225 Difference]: With dead ends: 2275 [2018-04-13 05:32:57,594 INFO L226 Difference]: Without dead ends: 2275 [2018-04-13 05:32:57,594 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-13 05:32:57,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2018-04-13 05:32:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2252. [2018-04-13 05:32:57,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2252 states. [2018-04-13 05:32:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3003 transitions. [2018-04-13 05:32:57,638 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3003 transitions. Word has length 68 [2018-04-13 05:32:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:57,638 INFO L459 AbstractCegarLoop]: Abstraction has 2252 states and 3003 transitions. [2018-04-13 05:32:57,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 05:32:57,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3003 transitions. [2018-04-13 05:32:57,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-13 05:32:57,640 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:57,640 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-13 05:32:57,640 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-13 05:32:57,641 INFO L82 PathProgramCache]: Analyzing trace with hash -351130211, now seen corresponding path program 1 times [2018-04-13 05:32:57,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:57,641 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:57,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:57,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:57,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:57,656 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:57,706 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-13 05:32:57,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:57,707 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:57,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:57,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:57,769 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-13 05:32:57,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:57,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-13 05:32:57,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 05:32:57,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 05:32:57,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:32:57,771 INFO L87 Difference]: Start difference. First operand 2252 states and 3003 transitions. Second operand 11 states. [2018-04-13 05:32:57,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:57,972 INFO L93 Difference]: Finished difference Result 2827 states and 3933 transitions. [2018-04-13 05:32:57,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 05:32:57,972 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-04-13 05:32:57,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:57,986 INFO L225 Difference]: With dead ends: 2827 [2018-04-13 05:32:57,986 INFO L226 Difference]: Without dead ends: 2823 [2018-04-13 05:32:57,986 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-13 05:32:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2018-04-13 05:32:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2226. [2018-04-13 05:32:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2226 states. [2018-04-13 05:32:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 2970 transitions. [2018-04-13 05:32:58,037 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 2970 transitions. Word has length 72 [2018-04-13 05:32:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:58,038 INFO L459 AbstractCegarLoop]: Abstraction has 2226 states and 2970 transitions. [2018-04-13 05:32:58,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 05:32:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 2970 transitions. [2018-04-13 05:32:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-13 05:32:58,039 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:58,039 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-13 05:32:58,039 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-13 05:32:58,040 INFO L82 PathProgramCache]: Analyzing trace with hash -638982733, now seen corresponding path program 1 times [2018-04-13 05:32:58,040 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:58,040 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:58,040 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:58,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:58,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:58,054 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 31 proven. 44 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-04-13 05:32:58,107 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:58,107 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:58,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:58,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:58,228 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-13 05:32:58,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:58,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-13 05:32:58,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 05:32:58,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 05:32:58,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-04-13 05:32:58,229 INFO L87 Difference]: Start difference. First operand 2226 states and 2970 transitions. Second operand 16 states. [2018-04-13 05:32:59,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:59,271 INFO L93 Difference]: Finished difference Result 5208 states and 7173 transitions. [2018-04-13 05:32:59,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 05:32:59,271 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 73 [2018-04-13 05:32:59,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:59,284 INFO L225 Difference]: With dead ends: 5208 [2018-04-13 05:32:59,284 INFO L226 Difference]: Without dead ends: 5208 [2018-04-13 05:32:59,285 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=585, Invalid=2837, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 05:32:59,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5208 states. [2018-04-13 05:32:59,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5208 to 4624. [2018-04-13 05:32:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4624 states. [2018-04-13 05:32:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4624 states to 4624 states and 6334 transitions. [2018-04-13 05:32:59,349 INFO L78 Accepts]: Start accepts. Automaton has 4624 states and 6334 transitions. Word has length 73 [2018-04-13 05:32:59,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:59,349 INFO L459 AbstractCegarLoop]: Abstraction has 4624 states and 6334 transitions. [2018-04-13 05:32:59,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 05:32:59,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4624 states and 6334 transitions. [2018-04-13 05:32:59,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-04-13 05:32:59,350 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:59,350 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2018-04-13 05:32:59,350 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-13 05:32:59,350 INFO L82 PathProgramCache]: Analyzing trace with hash 327735148, now seen corresponding path program 1 times [2018-04-13 05:32:59,350 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:59,350 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:59,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:59,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:59,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:59,361 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-04-13 05:32:59,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:59,445 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:59,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:59,479 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 95 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-04-13 05:32:59,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:59,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-04-13 05:32:59,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 05:32:59,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 05:32:59,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-04-13 05:32:59,580 INFO L87 Difference]: Start difference. First operand 4624 states and 6334 transitions. Second operand 18 states. [2018-04-13 05:33:02,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:33:02,672 INFO L93 Difference]: Finished difference Result 9136 states and 12855 transitions. [2018-04-13 05:33:02,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-13 05:33:02,673 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-04-13 05:33:02,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:33:02,698 INFO L225 Difference]: With dead ends: 9136 [2018-04-13 05:33:02,698 INFO L226 Difference]: Without dead ends: 9136 [2018-04-13 05:33:02,701 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4042 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1531, Invalid=10241, Unknown=0, NotChecked=0, Total=11772 [2018-04-13 05:33:02,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9136 states. [2018-04-13 05:33:02,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9136 to 7441. [2018-04-13 05:33:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7441 states. [2018-04-13 05:33:02,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 10402 transitions. [2018-04-13 05:33:02,812 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 10402 transitions. Word has length 91 [2018-04-13 05:33:02,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:33:02,812 INFO L459 AbstractCegarLoop]: Abstraction has 7441 states and 10402 transitions. [2018-04-13 05:33:02,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 05:33:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 10402 transitions. [2018-04-13 05:33:02,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-13 05:33:02,813 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:33:02,814 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 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, 1, 1, 1, 1] [2018-04-13 05:33:02,814 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-13 05:33:02,814 INFO L82 PathProgramCache]: Analyzing trace with hash 624469246, now seen corresponding path program 1 times [2018-04-13 05:33:02,814 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:33:02,814 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:33:02,814 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:33:02,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:33:02,814 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:33:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:33:02,824 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:33:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-04-13 05:33:02,940 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:33:02,940 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:33:02,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:33:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:33:02,973 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:33:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-04-13 05:33:03,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:33:03,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-04-13 05:33:03,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 05:33:03,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 05:33:03,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-04-13 05:33:03,088 INFO L87 Difference]: Start difference. First operand 7441 states and 10402 transitions. Second operand 13 states. [2018-04-13 05:33:03,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:33:03,366 INFO L93 Difference]: Finished difference Result 9231 states and 13049 transitions. [2018-04-13 05:33:03,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 05:33:03,366 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2018-04-13 05:33:03,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:33:03,388 INFO L225 Difference]: With dead ends: 9231 [2018-04-13 05:33:03,388 INFO L226 Difference]: Without dead ends: 9231 [2018-04-13 05:33:03,388 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 98 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-13 05:33:03,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9231 states. [2018-04-13 05:33:03,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9231 to 7441. [2018-04-13 05:33:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7441 states. [2018-04-13 05:33:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 10318 transitions. [2018-04-13 05:33:03,517 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 10318 transitions. Word has length 97 [2018-04-13 05:33:03,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:33:03,517 INFO L459 AbstractCegarLoop]: Abstraction has 7441 states and 10318 transitions. [2018-04-13 05:33:03,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 05:33:03,517 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 10318 transitions. [2018-04-13 05:33:03,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-04-13 05:33:03,519 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:33:03,519 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1] [2018-04-13 05:33:03,519 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-13 05:33:03,519 INFO L82 PathProgramCache]: Analyzing trace with hash 695729250, now seen corresponding path program 1 times [2018-04-13 05:33:03,519 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:33:03,519 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:33:03,520 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:33:03,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:33:03,520 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:33:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:33:03,535 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:33:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 47 proven. 95 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-04-13 05:33:03,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:33:03,664 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:33:03,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:33:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:33:03,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:33:03,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 05:33:03,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:33:03,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:33:03,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 05:33:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 53 proven. 89 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-04-13 05:33:03,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:33:03,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-04-13 05:33:03,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 05:33:03,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 05:33:03,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-04-13 05:33:03,908 INFO L87 Difference]: Start difference. First operand 7441 states and 10318 transitions. Second operand 15 states. [2018-04-13 05:33:04,653 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 37 DAG size of output 29 [2018-04-13 05:33:05,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:33:05,285 INFO L93 Difference]: Finished difference Result 10477 states and 14453 transitions. [2018-04-13 05:33:05,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 05:33:05,285 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 105 [2018-04-13 05:33:05,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:33:05,313 INFO L225 Difference]: With dead ends: 10477 [2018-04-13 05:33:05,313 INFO L226 Difference]: Without dead ends: 10477 [2018-04-13 05:33:05,314 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 115 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=341, Invalid=1551, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 05:33:05,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10477 states. [2018-04-13 05:33:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10477 to 9847. [2018-04-13 05:33:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9847 states. [2018-04-13 05:33:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9847 states to 9847 states and 13618 transitions. [2018-04-13 05:33:05,450 INFO L78 Accepts]: Start accepts. Automaton has 9847 states and 13618 transitions. Word has length 105 [2018-04-13 05:33:05,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:33:05,450 INFO L459 AbstractCegarLoop]: Abstraction has 9847 states and 13618 transitions. [2018-04-13 05:33:05,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 05:33:05,451 INFO L276 IsEmpty]: Start isEmpty. Operand 9847 states and 13618 transitions. [2018-04-13 05:33:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-04-13 05:33:05,454 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:33:05,454 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 9, 8, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:33:05,454 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-13 05:33:05,454 INFO L82 PathProgramCache]: Analyzing trace with hash -250289914, now seen corresponding path program 1 times [2018-04-13 05:33:05,454 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:33:05,454 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:33:05,455 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:33:05,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:33:05,455 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:33:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:33:05,467 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:33:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 86 proven. 4 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-04-13 05:33:05,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:33:05,517 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:33:05,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:33:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:33:05,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:33:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 86 proven. 4 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-04-13 05:33:05,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:33:05,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-13 05:33:05,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 05:33:05,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 05:33:05,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:33:05,593 INFO L87 Difference]: Start difference. First operand 9847 states and 13618 transitions. Second operand 11 states. [2018-04-13 05:33:05,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:33:05,783 INFO L93 Difference]: Finished difference Result 10349 states and 13914 transitions. [2018-04-13 05:33:05,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 05:33:05,784 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 131 [2018-04-13 05:33:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:33:05,800 INFO L225 Difference]: With dead ends: 10349 [2018-04-13 05:33:05,800 INFO L226 Difference]: Without dead ends: 9845 [2018-04-13 05:33:05,800 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-04-13 05:33:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9845 states. [2018-04-13 05:33:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9845 to 9263. [2018-04-13 05:33:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9263 states. [2018-04-13 05:33:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9263 states to 9263 states and 12581 transitions. [2018-04-13 05:33:05,896 INFO L78 Accepts]: Start accepts. Automaton has 9263 states and 12581 transitions. Word has length 131 [2018-04-13 05:33:05,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:33:05,896 INFO L459 AbstractCegarLoop]: Abstraction has 9263 states and 12581 transitions. [2018-04-13 05:33:05,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 05:33:05,896 INFO L276 IsEmpty]: Start isEmpty. Operand 9263 states and 12581 transitions. [2018-04-13 05:33:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-04-13 05:33:05,900 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:33:05,900 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 9, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:33:05,900 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-13 05:33:05,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1889495301, now seen corresponding path program 1 times [2018-04-13 05:33:05,900 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:33:05,901 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:33:05,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:33:05,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:33:05,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:33:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-13 05:33:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-13 05:33:05,968 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-13 05:33:06,076 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-04-13 05:33:06,087 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-13 05:33:06,087 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-13 05:33:06,088 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-13 05:33:06,089 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-13 05:33:06,089 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-13 05:33:06,090 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-13 05:33:06,092 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-13 05:33:06,093 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-13 05:33:06,093 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-13 05:33:06,094 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-13 05:33:06,096 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-13 05:33:06,096 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-13 05:33:06,097 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-13 05:33:06,097 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-13 05:33:06,099 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-13 05:33:06,099 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-13 05:33:06,100 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-13 05:33:06,100 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-13 05:33:06,100 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-13 05:33:06,101 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-13 05:33:06,102 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-13 05:33:06,102 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-13 05:33:06,103 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-13 05:33:06,103 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-13 05:33:06,103 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-13 05:33:06,104 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-13 05:33:06,104 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-13 05:33:06,105 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-13 05:33:06,105 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-13 05:33:06,106 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-13 05:33:06,106 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-13 05:33:06,106 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-13 05:33:06,106 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-13 05:33:06,107 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-13 05:33:06,108 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,108 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,109 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,110 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,110 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,110 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,111 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,112 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,112 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,112 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,113 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,114 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,114 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,114 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,114 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,115 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,115 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-13 05:33:06,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:33:06 BoogieIcfgContainer [2018-04-13 05:33:06,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 05:33:06,132 INFO L168 Benchmark]: Toolchain (without parser) took 17193.45 ms. Allocated memory was 404.2 MB in the beginning and 1.1 GB in the end (delta: 705.2 MB). Free memory was 341.2 MB in the beginning and 991.7 MB in the end (delta: -650.6 MB). Peak memory consumption was 649.3 MB. Max. memory is 5.3 GB. [2018-04-13 05:33:06,133 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 404.2 MB. Free memory is still 365.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 05:33:06,133 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.80 ms. Allocated memory is still 404.2 MB. Free memory was 339.8 MB in the beginning and 314.6 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-04-13 05:33:06,133 INFO L168 Benchmark]: Boogie Preprocessor took 43.96 ms. Allocated memory is still 404.2 MB. Free memory was 314.6 MB in the beginning and 312.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 05:33:06,134 INFO L168 Benchmark]: RCFGBuilder took 397.65 ms. Allocated memory was 404.2 MB in the beginning and 613.4 MB in the end (delta: 209.2 MB). Free memory was 310.7 MB in the beginning and 539.7 MB in the end (delta: -229.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-13 05:33:06,134 INFO L168 Benchmark]: TraceAbstraction took 16505.33 ms. Allocated memory was 613.4 MB in the beginning and 1.1 GB in the end (delta: 496.0 MB). Free memory was 539.7 MB in the beginning and 991.7 MB in the end (delta: -452.0 MB). Peak memory consumption was 638.7 MB. Max. memory is 5.3 GB. [2018-04-13 05:33:06,136 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.23 ms. Allocated memory is still 404.2 MB. Free memory is still 365.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 243.80 ms. Allocated memory is still 404.2 MB. Free memory was 339.8 MB in the beginning and 314.6 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.96 ms. Allocated memory is still 404.2 MB. Free memory was 314.6 MB in the beginning and 312.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 397.65 ms. Allocated memory was 404.2 MB in the beginning and 613.4 MB in the end (delta: 209.2 MB). Free memory was 310.7 MB in the beginning and 539.7 MB in the end (delta: -229.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 16505.33 ms. Allocated memory was 613.4 MB in the beginning and 1.1 GB in the end (delta: 496.0 MB). Free memory was 539.7 MB in the beginning and 991.7 MB in the end (delta: -452.0 MB). Peak memory consumption was 638.7 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 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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)=12, \old(S)=25, \old(t1)=24, \old(t1)=22, \old(t4)=18, \old(t4)=13, \old(x1)=20, \old(x1)=14, \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] S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L690] S || 1 != pc1 || __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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] S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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)=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}] [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)=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}] [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)=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}] [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] S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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)=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}] [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)=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}] [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] S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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)=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}] [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)=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}] [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)=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}] [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)=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}] [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] S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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)=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}] [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)=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}] [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] S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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)=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=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)=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}] [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)=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=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)=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}] [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)=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}] [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)=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=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] S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \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)=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}] [L663] pc4++ [L663] pc4++ [L664] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \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)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, pc4++=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L664] COND TRUE case 1: [L665] RET t4 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \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)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, pc4++=1, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L694] pop() 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=2, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() 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=2, res4=0, S={10:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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=2, res4=0, S={10:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=10, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L663] pc4++ [L663] pc4++ [L664] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=10, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L664] COND FALSE !(case 1:) [L667] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L667] COND TRUE case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=10, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L668] COND FALSE, RET !(t4 == ((void *)0)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=10, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L694] pop() 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=3, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() 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=3, res4=0, S={10:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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=3, res4=0, S={10:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=10, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L663] pc4++ [L663] pc4++ [L664] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=10, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L664] COND FALSE !(case 1:) [L667] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L667] COND FALSE !(case 2:) [L671] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L671] COND TRUE case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=10, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L672] EXPR, FCALL t4->next VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=10, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={10:0}, t1={0:0}, t4={10:0}, t4->next={0:0}, x1={10:0}, x4={0:0}] [L672] RET x4 = t4->next [L694] pop() 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=4, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() 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=4, res4=0, S={10:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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=4, res4=0, S={10:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L663] pc4++ [L663] pc4++ [L664] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L664] COND FALSE !(case 1:) [L667] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L667] COND FALSE !(case 2:) [L671] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L671] COND FALSE !(case 3:) [L674] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=10, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L674] COND TRUE case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=10, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L675] COND TRUE S == t4 [L676] RET S = x4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L694] pop() 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=5, res4=0, S={0:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() 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=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L690] S || 1 != pc1 || __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || __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=5, res4=0, S={0:0}, t1={0:0}, t4={10: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=5, 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, 16.4s OverallTime, 27 OverallIterations, 11 TraceHistogramMax, 11.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2674 SDtfs, 7128 SDslu, 6696 SDs, 0 SdLazy, 10923 SolverSat, 1685 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1725 GetRequests, 1206 SyntacticMatches, 31 SemanticMatches, 488 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6301 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9847occurred in iteration=25, 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: 1.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 8425 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2441 NumberOfCodeBlocks, 2441 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2253 ConstructedInterpolants, 10 QuantifiedInterpolants, 502770 SizeOfPredicates, 65 NumberOfNonLiveVariables, 8121 ConjunctsInSsa, 270 ConjunctsInUnsatCore, 43 InterpolantComputations, 12 PerfectInterpolantSequences, 2383/2844 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.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_05-33-06-144.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_05-33-06-144.csv Received shutdown request...