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_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-12 11:35:28,631 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 11:35:28,632 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 11:35:28,644 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 11:35:28,644 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 11:35:28,645 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 11:35:28,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 11:35:28,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 11:35:28,649 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 11:35:28,649 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 11:35:28,650 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 11:35:28,650 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 11:35:28,651 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 11:35:28,652 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 11:35:28,652 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 11:35:28,654 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 11:35:28,655 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 11:35:28,657 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 11:35:28,658 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 11:35:28,658 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 11:35:28,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 11:35:28,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 11:35:28,661 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 11:35:28,661 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 11:35:28,662 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 11:35:28,663 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 11:35:28,663 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 11:35:28,664 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 11:35:28,664 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 11:35:28,665 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 11:35:28,665 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 11:35:28,665 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-12 11:35:28,673 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 11:35:28,674 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 11:35:28,674 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 11:35:28,675 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 11:35:28,675 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 11:35:28,675 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 11:35:28,675 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 11:35:28,675 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 11:35:28,675 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 11:35:28,675 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 11:35:28,675 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 11:35:28,675 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 11:35:28,675 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 11:35:28,676 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 11:35:28,676 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 11:35:28,676 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 11:35:28,676 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 11:35:28,676 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 11:35:28,676 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 11:35:28,676 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 11:35:28,676 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 11:35:28,676 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 11:35:28,677 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 11:35:28,677 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 11:35:28,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 11:35:28,711 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 11:35:28,713 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 11:35:28,714 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 11:35:28,715 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 11:35:28,715 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-12 11:35:29,077 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGdd27c1970 [2018-04-12 11:35:29,202 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 11:35:29,202 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 11:35:29,203 INFO L168 CDTParser]: Scanning lockfree-3.3_false-valid-memtrack.i [2018-04-12 11:35:29,209 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 11:35:29,209 INFO L215 ultiparseSymbolTable]: [2018-04-12 11:35:29,209 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 11:35:29,209 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-12 11:35:29,210 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in lockfree-3.3_false-valid-memtrack.i [2018-04-12 11:35:29,210 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-12 11:35:29,210 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 11:35:29,210 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-12 11:35:29,210 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-12 11:35:29,210 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-12 11:35:29,210 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-12 11:35:29,210 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-12 11:35:29,210 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-12 11:35:29,210 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-12 11:35:29,210 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-12 11:35:29,211 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-12 11:35:29,211 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-12 11:35:29,211 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-12 11:35:29,211 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-12 11:35:29,211 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-12 11:35:29,211 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-12 11:35:29,211 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-12 11:35:29,211 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-12 11:35:29,211 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-12 11:35:29,211 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-12 11:35:29,211 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-12 11:35:29,212 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-12 11:35:29,212 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-12 11:35:29,212 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-12 11:35:29,212 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-12 11:35:29,212 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-12 11:35:29,212 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-12 11:35:29,212 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-12 11:35:29,212 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-12 11:35:29,212 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-12 11:35:29,212 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-12 11:35:29,212 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-12 11:35:29,213 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-12 11:35:29,213 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-12 11:35:29,213 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-12 11:35:29,213 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-12 11:35:29,213 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-12 11:35:29,213 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-12 11:35:29,213 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-12 11:35:29,213 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-12 11:35:29,213 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-12 11:35:29,213 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-12 11:35:29,213 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-12 11:35:29,213 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-12 11:35:29,213 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-12 11:35:29,213 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-12 11:35:29,213 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,214 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-12 11:35:29,215 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-12 11:35:29,215 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-12 11:35:29,215 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-12 11:35:29,215 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-12 11:35:29,215 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-12 11:35:29,215 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-12 11:35:29,215 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-12 11:35:29,215 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-12 11:35:29,215 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-12 11:35:29,215 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-12 11:35:29,215 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-12 11:35:29,215 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-12 11:35:29,215 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-12 11:35:29,215 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-12 11:35:29,215 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-12 11:35:29,215 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-12 11:35:29,215 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-12 11:35:29,216 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-12 11:35:29,216 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-12 11:35:29,216 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-12 11:35:29,216 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-12 11:35:29,216 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-12 11:35:29,216 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-12 11:35:29,216 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-12 11:35:29,216 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-12 11:35:29,216 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-12 11:35:29,216 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-12 11:35:29,216 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-12 11:35:29,216 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-12 11:35:29,217 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-12 11:35:29,217 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-12 11:35:29,217 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-12 11:35:29,217 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-12 11:35:29,217 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-12 11:35:29,217 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-12 11:35:29,217 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-12 11:35:29,217 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-12 11:35:29,217 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-12 11:35:29,217 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-12 11:35:29,217 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-12 11:35:29,218 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-12 11:35:29,218 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-12 11:35:29,218 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-12 11:35:29,218 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-12 11:35:29,218 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-12 11:35:29,218 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-12 11:35:29,218 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-12 11:35:29,218 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-12 11:35:29,218 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-12 11:35:29,218 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-12 11:35:29,218 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-12 11:35:29,219 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-12 11:35:29,219 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-12 11:35:29,219 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-12 11:35:29,219 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-12 11:35:29,219 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-12 11:35:29,219 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-12 11:35:29,219 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-12 11:35:29,219 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-12 11:35:29,219 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-12 11:35:29,219 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-12 11:35:29,220 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-12 11:35:29,232 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGdd27c1970 [2018-04-12 11:35:29,236 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 11:35:29,237 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 11:35:29,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 11:35:29,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 11:35:29,243 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 11:35:29,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 11:35:29" (1/1) ... [2018-04-12 11:35:29,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388590b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:35:29, skipping insertion in model container [2018-04-12 11:35:29,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 11:35:29" (1/1) ... [2018-04-12 11:35:29,258 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 11:35:29,282 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 11:35:29,403 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 11:35:29,438 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 11:35:29,445 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-12 11:35:29,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:35:29 WrapperNode [2018-04-12 11:35:29,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 11:35:29,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 11:35:29,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 11:35:29,486 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 11:35:29,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:35:29" (1/1) ... [2018-04-12 11:35:29,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:35:29" (1/1) ... [2018-04-12 11:35:29,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:35:29" (1/1) ... [2018-04-12 11:35:29,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:35:29" (1/1) ... [2018-04-12 11:35:29,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:35:29" (1/1) ... [2018-04-12 11:35:29,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:35:29" (1/1) ... [2018-04-12 11:35:29,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:35:29" (1/1) ... [2018-04-12 11:35:29,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 11:35:29,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 11:35:29,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 11:35:29,531 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 11:35:29,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:35:29" (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-12 11:35:29,621 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 11:35:29,621 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 11:35:29,621 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-12 11:35:29,621 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-12 11:35:29,622 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 11:35:29,622 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 11:35:29,622 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 11:35:29,622 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 11:35:29,622 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 11:35:29,622 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 11:35:29,622 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 11:35:29,622 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 11:35:29,622 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 11:35:29,622 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 11:35:29,622 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 11:35:29,623 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 11:35:29,623 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 11:35:29,623 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 11:35:29,623 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 11:35:29,623 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 11:35:29,623 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 11:35:29,623 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 11:35:29,623 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 11:35:29,623 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 11:35:29,623 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 11:35:29,624 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 11:35:29,624 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 11:35:29,624 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 11:35:29,624 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 11:35:29,624 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 11:35:29,624 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 11:35:29,624 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 11:35:29,624 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 11:35:29,624 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 11:35:29,624 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 11:35:29,625 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 11:35:29,625 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 11:35:29,625 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 11:35:29,625 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 11:35:29,625 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 11:35:29,625 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 11:35:29,625 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 11:35:29,625 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 11:35:29,625 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 11:35:29,625 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 11:35:29,626 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 11:35:29,626 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 11:35:29,626 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 11:35:29,626 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 11:35:29,626 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 11:35:29,626 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 11:35:29,626 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 11:35:29,626 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 11:35:29,626 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 11:35:29,626 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 11:35:29,627 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 11:35:29,627 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 11:35:29,627 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 11:35:29,627 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 11:35:29,627 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 11:35:29,627 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 11:35:29,627 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 11:35:29,627 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 11:35:29,627 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 11:35:29,627 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 11:35:29,628 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 11:35:29,629 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 11:35:29,629 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 11:35:29,629 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 11:35:29,629 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 11:35:29,629 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 11:35:29,629 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 11:35:29,629 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 11:35:29,629 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 11:35:29,629 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 11:35:29,629 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 11:35:29,629 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 11:35:29,629 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 11:35:29,629 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 11:35:29,630 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 11:35:29,630 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 11:35:29,630 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 11:35:29,630 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 11:35:29,630 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 11:35:29,630 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 11:35:29,630 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 11:35:29,630 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 11:35:29,630 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 11:35:29,630 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 11:35:29,630 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 11:35:29,631 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 11:35:29,631 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 11:35:29,631 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-12 11:35:29,631 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 11:35:29,631 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 11:35:29,631 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 11:35:29,631 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-12 11:35:29,631 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 11:35:29,631 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 11:35:29,631 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 11:35:29,631 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 11:35:29,631 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 11:35:29,632 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 11:35:29,632 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 11:35:29,968 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 11:35:29,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 11:35:29 BoogieIcfgContainer [2018-04-12 11:35:29,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 11:35:29,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 11:35:29,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 11:35:29,971 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 11:35:29,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 11:35:29" (1/3) ... [2018-04-12 11:35:29,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110280a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 11:35:29, skipping insertion in model container [2018-04-12 11:35:29,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:35:29" (2/3) ... [2018-04-12 11:35:29,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110280a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 11:35:29, skipping insertion in model container [2018-04-12 11:35:29,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 11:35:29" (3/3) ... [2018-04-12 11:35:29,973 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.3_false-valid-memtrack.i [2018-04-12 11:35:29,979 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 11:35:29,983 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-04-12 11:35:30,006 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 11:35:30,006 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 11:35:30,006 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 11:35:30,006 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 11:35:30,006 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 11:35:30,006 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 11:35:30,006 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 11:35:30,006 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 11:35:30,006 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 11:35:30,007 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 11:35:30,014 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-04-12 11:35:30,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-12 11:35:30,020 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:30,020 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 11:35:30,020 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-12 11:35:30,023 INFO L82 PathProgramCache]: Analyzing trace with hash 764612502, now seen corresponding path program 1 times [2018-04-12 11:35:30,024 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:30,024 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:30,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:30,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:30,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:30,090 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:30,122 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-12 11:35:30,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 11:35:30,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-12 11:35:30,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-12 11:35:30,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-12 11:35:30,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-12 11:35:30,137 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-04-12 11:35:30,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:30,156 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-04-12 11:35:30,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-12 11:35:30,157 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-04-12 11:35:30,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:30,167 INFO L225 Difference]: With dead ends: 78 [2018-04-12 11:35:30,168 INFO L226 Difference]: Without dead ends: 75 [2018-04-12 11:35:30,169 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-12 11:35:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-12 11:35:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-12 11:35:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-12 11:35:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2018-04-12 11:35:30,196 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 9 [2018-04-12 11:35:30,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:30,196 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2018-04-12 11:35:30,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-12 11:35:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2018-04-12 11:35:30,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-12 11:35:30,196 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:30,196 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 11:35:30,197 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-12 11:35:30,197 INFO L82 PathProgramCache]: Analyzing trace with hash -2144181541, now seen corresponding path program 1 times [2018-04-12 11:35:30,197 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:30,197 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:30,198 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:30,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:30,198 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:30,215 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:30,239 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-12 11:35:30,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 11:35:30,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 11:35:30,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 11:35:30,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 11:35:30,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 11:35:30,241 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 3 states. [2018-04-12 11:35:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:30,251 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-04-12 11:35:30,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 11:35:30,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-12 11:35:30,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:30,252 INFO L225 Difference]: With dead ends: 76 [2018-04-12 11:35:30,252 INFO L226 Difference]: Without dead ends: 76 [2018-04-12 11:35:30,253 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-12 11:35:30,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-04-12 11:35:30,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-04-12 11:35:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-12 11:35:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2018-04-12 11:35:30,259 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 12 [2018-04-12 11:35:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:30,259 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2018-04-12 11:35:30,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 11:35:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2018-04-12 11:35:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-12 11:35:30,259 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:30,260 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 11:35:30,260 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-12 11:35:30,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2142334499, now seen corresponding path program 1 times [2018-04-12 11:35:30,260 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:30,260 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:30,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:30,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:30,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:30,275 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:30,326 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-12 11:35:30,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 11:35:30,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 11:35:30,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 11:35:30,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 11:35:30,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 11:35:30,327 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 3 states. [2018-04-12 11:35:30,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:30,351 INFO L93 Difference]: Finished difference Result 134 states and 169 transitions. [2018-04-12 11:35:30,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 11:35:30,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-12 11:35:30,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:30,353 INFO L225 Difference]: With dead ends: 134 [2018-04-12 11:35:30,353 INFO L226 Difference]: Without dead ends: 134 [2018-04-12 11:35:30,353 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-12 11:35:30,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-12 11:35:30,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2018-04-12 11:35:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-12 11:35:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2018-04-12 11:35:30,362 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 12 [2018-04-12 11:35:30,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:30,362 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2018-04-12 11:35:30,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 11:35:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2018-04-12 11:35:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-12 11:35:30,362 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:30,363 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 11:35:30,363 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-12 11:35:30,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1987861526, now seen corresponding path program 1 times [2018-04-12 11:35:30,363 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:30,363 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:30,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:30,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:30,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:30,377 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:30,393 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-12 11:35:30,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 11:35:30,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-12 11:35:30,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 11:35:30,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 11:35:30,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 11:35:30,394 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand 3 states. [2018-04-12 11:35:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:30,447 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2018-04-12 11:35:30,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 11:35:30,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-04-12 11:35:30,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:30,449 INFO L225 Difference]: With dead ends: 151 [2018-04-12 11:35:30,449 INFO L226 Difference]: Without dead ends: 147 [2018-04-12 11:35:30,449 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-12 11:35:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-12 11:35:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2018-04-12 11:35:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-12 11:35:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2018-04-12 11:35:30,456 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 194 transitions. Word has length 13 [2018-04-12 11:35:30,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:30,457 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 194 transitions. [2018-04-12 11:35:30,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 11:35:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 194 transitions. [2018-04-12 11:35:30,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-12 11:35:30,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:30,457 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 11:35:30,457 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-12 11:35:30,457 INFO L82 PathProgramCache]: Analyzing trace with hash -990934181, now seen corresponding path program 1 times [2018-04-12 11:35:30,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:30,458 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:30,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:30,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:30,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:30,467 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:30,494 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-12 11:35:30,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 11:35:30,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 11:35:30,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 11:35:30,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 11:35:30,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 11:35:30,495 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. Second operand 5 states. [2018-04-12 11:35:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:30,566 INFO L93 Difference]: Finished difference Result 259 states and 361 transitions. [2018-04-12 11:35:30,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 11:35:30,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-12 11:35:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:30,568 INFO L225 Difference]: With dead ends: 259 [2018-04-12 11:35:30,569 INFO L226 Difference]: Without dead ends: 259 [2018-04-12 11:35:30,569 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-12 11:35:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-12 11:35:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 228. [2018-04-12 11:35:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-12 11:35:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 340 transitions. [2018-04-12 11:35:30,583 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 340 transitions. Word has length 15 [2018-04-12 11:35:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:30,584 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 340 transitions. [2018-04-12 11:35:30,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 11:35:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 340 transitions. [2018-04-12 11:35:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-12 11:35:30,585 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:30,585 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 11:35:30,585 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-12 11:35:30,585 INFO L82 PathProgramCache]: Analyzing trace with hash -654467540, now seen corresponding path program 1 times [2018-04-12 11:35:30,585 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:30,585 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:30,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:30,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:30,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:30,596 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:30,617 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-12 11:35:30,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 11:35:30,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 11:35:30,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 11:35:30,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 11:35:30,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 11:35:30,618 INFO L87 Difference]: Start difference. First operand 228 states and 340 transitions. Second operand 4 states. [2018-04-12 11:35:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:30,716 INFO L93 Difference]: Finished difference Result 390 states and 573 transitions. [2018-04-12 11:35:30,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 11:35:30,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-12 11:35:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:30,719 INFO L225 Difference]: With dead ends: 390 [2018-04-12 11:35:30,719 INFO L226 Difference]: Without dead ends: 390 [2018-04-12 11:35:30,719 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-12 11:35:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-04-12 11:35:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 360. [2018-04-12 11:35:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-04-12 11:35:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 550 transitions. [2018-04-12 11:35:30,735 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 550 transitions. Word has length 16 [2018-04-12 11:35:30,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:30,736 INFO L459 AbstractCegarLoop]: Abstraction has 360 states and 550 transitions. [2018-04-12 11:35:30,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 11:35:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 550 transitions. [2018-04-12 11:35:30,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-12 11:35:30,736 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:30,737 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 11:35:30,737 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-12 11:35:30,737 INFO L82 PathProgramCache]: Analyzing trace with hash -654467539, now seen corresponding path program 1 times [2018-04-12 11:35:30,737 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:30,737 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:30,738 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:30,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:30,738 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:30,745 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:30,774 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-12 11:35:30,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 11:35:30,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 11:35:30,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 11:35:30,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 11:35:30,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 11:35:30,775 INFO L87 Difference]: Start difference. First operand 360 states and 550 transitions. Second operand 4 states. [2018-04-12 11:35:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:30,871 INFO L93 Difference]: Finished difference Result 489 states and 720 transitions. [2018-04-12 11:35:30,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 11:35:30,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-12 11:35:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:30,874 INFO L225 Difference]: With dead ends: 489 [2018-04-12 11:35:30,874 INFO L226 Difference]: Without dead ends: 489 [2018-04-12 11:35:30,874 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-12 11:35:30,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-04-12 11:35:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 462. [2018-04-12 11:35:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-04-12 11:35:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 698 transitions. [2018-04-12 11:35:30,887 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 698 transitions. Word has length 16 [2018-04-12 11:35:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:30,887 INFO L459 AbstractCegarLoop]: Abstraction has 462 states and 698 transitions. [2018-04-12 11:35:30,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 11:35:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 698 transitions. [2018-04-12 11:35:30,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-12 11:35:30,888 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:30,888 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 11:35:30,888 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-12 11:35:30,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2111148230, now seen corresponding path program 1 times [2018-04-12 11:35:30,889 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:30,889 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:30,889 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:30,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:30,890 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:30,897 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:30,918 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-12 11:35:30,919 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 11:35:30,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 11:35:30,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 11:35:30,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 11:35:30,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 11:35:30,919 INFO L87 Difference]: Start difference. First operand 462 states and 698 transitions. Second operand 5 states. [2018-04-12 11:35:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:30,975 INFO L93 Difference]: Finished difference Result 865 states and 1229 transitions. [2018-04-12 11:35:30,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 11:35:30,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-12 11:35:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:30,980 INFO L225 Difference]: With dead ends: 865 [2018-04-12 11:35:30,980 INFO L226 Difference]: Without dead ends: 865 [2018-04-12 11:35:30,980 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-12 11:35:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-04-12 11:35:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 830. [2018-04-12 11:35:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-04-12 11:35:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1198 transitions. [2018-04-12 11:35:31,006 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1198 transitions. Word has length 16 [2018-04-12 11:35:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:31,006 INFO L459 AbstractCegarLoop]: Abstraction has 830 states and 1198 transitions. [2018-04-12 11:35:31,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 11:35:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1198 transitions. [2018-04-12 11:35:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-12 11:35:31,007 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:31,007 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-12 11:35:31,007 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-12 11:35:31,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1464034702, now seen corresponding path program 1 times [2018-04-12 11:35:31,008 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:31,008 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:31,008 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:31,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:31,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:31,020 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:31,052 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-12 11:35:31,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 11:35:31,053 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 11:35:31,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:31,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 11:35:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 11:35:31,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 11:35:31,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-04-12 11:35:31,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 11:35:31,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 11:35:31,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-12 11:35:31,204 INFO L87 Difference]: Start difference. First operand 830 states and 1198 transitions. Second operand 9 states. [2018-04-12 11:35:31,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:31,547 INFO L93 Difference]: Finished difference Result 1426 states and 2036 transitions. [2018-04-12 11:35:31,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 11:35:31,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-04-12 11:35:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:31,551 INFO L225 Difference]: With dead ends: 1426 [2018-04-12 11:35:31,551 INFO L226 Difference]: Without dead ends: 1426 [2018-04-12 11:35:31,551 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-04-12 11:35:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2018-04-12 11:35:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1270. [2018-04-12 11:35:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-04-12 11:35:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1794 transitions. [2018-04-12 11:35:31,583 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1794 transitions. Word has length 26 [2018-04-12 11:35:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:31,583 INFO L459 AbstractCegarLoop]: Abstraction has 1270 states and 1794 transitions. [2018-04-12 11:35:31,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 11:35:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1794 transitions. [2018-04-12 11:35:31,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-12 11:35:31,585 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:31,585 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-12 11:35:31,585 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-12 11:35:31,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1396165131, now seen corresponding path program 1 times [2018-04-12 11:35:31,585 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:31,585 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:31,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:31,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:31,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:31,596 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:31,619 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-12 11:35:31,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 11:35:31,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 11:35:31,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 11:35:31,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 11:35:31,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-12 11:35:31,620 INFO L87 Difference]: Start difference. First operand 1270 states and 1794 transitions. Second operand 5 states. [2018-04-12 11:35:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:31,674 INFO L93 Difference]: Finished difference Result 1898 states and 2757 transitions. [2018-04-12 11:35:31,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 11:35:31,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-04-12 11:35:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:31,680 INFO L225 Difference]: With dead ends: 1898 [2018-04-12 11:35:31,680 INFO L226 Difference]: Without dead ends: 1898 [2018-04-12 11:35:31,681 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-12 11:35:31,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2018-04-12 11:35:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1876. [2018-04-12 11:35:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1876 states. [2018-04-12 11:35:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2745 transitions. [2018-04-12 11:35:31,729 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2745 transitions. Word has length 27 [2018-04-12 11:35:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:31,729 INFO L459 AbstractCegarLoop]: Abstraction has 1876 states and 2745 transitions. [2018-04-12 11:35:31,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 11:35:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2745 transitions. [2018-04-12 11:35:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 11:35:31,730 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:31,730 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-12 11:35:31,731 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-12 11:35:31,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1008277157, now seen corresponding path program 1 times [2018-04-12 11:35:31,731 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:31,731 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:31,732 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:31,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:31,732 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:31,741 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:31,813 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-12 11:35:31,813 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 11:35:31,813 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 11:35:31,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:31,852 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 11:35:31,940 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-12 11:35:31,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-12 11:35:31,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-04-12 11:35:31,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 11:35:31,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 11:35:31,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-12 11:35:31,960 INFO L87 Difference]: Start difference. First operand 1876 states and 2745 transitions. Second operand 11 states. [2018-04-12 11:35:32,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:32,574 INFO L93 Difference]: Finished difference Result 988 states and 1245 transitions. [2018-04-12 11:35:32,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 11:35:32,574 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-04-12 11:35:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:32,578 INFO L225 Difference]: With dead ends: 988 [2018-04-12 11:35:32,578 INFO L226 Difference]: Without dead ends: 892 [2018-04-12 11:35:32,578 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-12 11:35:32,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2018-04-12 11:35:32,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 829. [2018-04-12 11:35:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-04-12 11:35:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1092 transitions. [2018-04-12 11:35:32,601 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1092 transitions. Word has length 31 [2018-04-12 11:35:32,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:32,601 INFO L459 AbstractCegarLoop]: Abstraction has 829 states and 1092 transitions. [2018-04-12 11:35:32,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 11:35:32,602 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1092 transitions. [2018-04-12 11:35:32,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-12 11:35:32,603 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:32,603 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-12 11:35:32,603 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-12 11:35:32,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1776763504, now seen corresponding path program 1 times [2018-04-12 11:35:32,603 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:32,603 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:32,604 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:32,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:32,604 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:32,615 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:32,673 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-12 11:35:32,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 11:35:32,673 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 11:35:32,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:32,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 11:35:32,743 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-12 11:35:32,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-12 11:35:32,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-04-12 11:35:32,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 11:35:32,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 11:35:32,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-04-12 11:35:32,767 INFO L87 Difference]: Start difference. First operand 829 states and 1092 transitions. Second operand 10 states. [2018-04-12 11:35:33,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:33,240 INFO L93 Difference]: Finished difference Result 2718 states and 3669 transitions. [2018-04-12 11:35:33,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 11:35:33,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-04-12 11:35:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:33,252 INFO L225 Difference]: With dead ends: 2718 [2018-04-12 11:35:33,252 INFO L226 Difference]: Without dead ends: 2718 [2018-04-12 11:35:33,253 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-12 11:35:33,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2018-04-12 11:35:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2410. [2018-04-12 11:35:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2018-04-12 11:35:33,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 3191 transitions. [2018-04-12 11:35:33,327 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 3191 transitions. Word has length 38 [2018-04-12 11:35:33,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:33,327 INFO L459 AbstractCegarLoop]: Abstraction has 2410 states and 3191 transitions. [2018-04-12 11:35:33,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 11:35:33,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 3191 transitions. [2018-04-12 11:35:33,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-12 11:35:33,328 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:33,328 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 11:35:33,328 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-12 11:35:33,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1993867459, now seen corresponding path program 1 times [2018-04-12 11:35:33,328 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:33,329 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:33,329 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:33,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:33,329 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:33,341 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-12 11:35:33,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 11:35:33,457 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 11:35:33,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:33,515 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 11:35:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-12 11:35:33,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 11:35:33,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-04-12 11:35:33,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-12 11:35:33,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-12 11:35:33,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-04-12 11:35:33,619 INFO L87 Difference]: Start difference. First operand 2410 states and 3191 transitions. Second operand 15 states. [2018-04-12 11:35:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:34,285 INFO L93 Difference]: Finished difference Result 2033 states and 2572 transitions. [2018-04-12 11:35:34,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 11:35:34,285 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-04-12 11:35:34,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:34,291 INFO L225 Difference]: With dead ends: 2033 [2018-04-12 11:35:34,292 INFO L226 Difference]: Without dead ends: 1955 [2018-04-12 11:35:34,292 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=1121, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 11:35:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2018-04-12 11:35:34,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1798. [2018-04-12 11:35:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1798 states. [2018-04-12 11:35:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2280 transitions. [2018-04-12 11:35:34,340 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2280 transitions. Word has length 41 [2018-04-12 11:35:34,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:34,340 INFO L459 AbstractCegarLoop]: Abstraction has 1798 states and 2280 transitions. [2018-04-12 11:35:34,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-12 11:35:34,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2280 transitions. [2018-04-12 11:35:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-12 11:35:34,341 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:34,341 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-12 11:35:34,341 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-12 11:35:34,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2142437170, now seen corresponding path program 1 times [2018-04-12 11:35:34,341 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:34,342 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:34,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:34,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:34,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:34,357 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:34,420 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-12 11:35:34,421 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 11:35:34,421 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 11:35:34,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:34,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 11:35:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-12 11:35:34,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 11:35:34,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2018-04-12 11:35:34,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 11:35:34,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 11:35:34,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-04-12 11:35:34,561 INFO L87 Difference]: Start difference. First operand 1798 states and 2280 transitions. Second operand 13 states. [2018-04-12 11:35:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:34,881 INFO L93 Difference]: Finished difference Result 1890 states and 2360 transitions. [2018-04-12 11:35:34,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 11:35:34,882 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-04-12 11:35:34,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:34,887 INFO L225 Difference]: With dead ends: 1890 [2018-04-12 11:35:34,887 INFO L226 Difference]: Without dead ends: 1858 [2018-04-12 11:35:34,887 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2018-04-12 11:35:34,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2018-04-12 11:35:34,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1766. [2018-04-12 11:35:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2018-04-12 11:35:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2232 transitions. [2018-04-12 11:35:34,920 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2232 transitions. Word has length 42 [2018-04-12 11:35:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:34,920 INFO L459 AbstractCegarLoop]: Abstraction has 1766 states and 2232 transitions. [2018-04-12 11:35:34,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 11:35:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2232 transitions. [2018-04-12 11:35:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-12 11:35:34,921 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:34,922 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-12 11:35:34,922 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-12 11:35:34,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1766984159, now seen corresponding path program 1 times [2018-04-12 11:35:34,922 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:34,922 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:34,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:34,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:34,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:34,940 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:34,998 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-12 11:35:34,999 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 11:35:34,999 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 11:35:35,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:35,056 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 11:35:35,106 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-12 11:35:35,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 11:35:35,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-12 11:35:35,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 11:35:35,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 11:35:35,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-12 11:35:35,125 INFO L87 Difference]: Start difference. First operand 1766 states and 2232 transitions. Second operand 11 states. [2018-04-12 11:35:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:35,374 INFO L93 Difference]: Finished difference Result 2193 states and 2798 transitions. [2018-04-12 11:35:35,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 11:35:35,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-04-12 11:35:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:35,382 INFO L225 Difference]: With dead ends: 2193 [2018-04-12 11:35:35,382 INFO L226 Difference]: Without dead ends: 2193 [2018-04-12 11:35:35,382 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-12 11:35:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2018-04-12 11:35:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 2137. [2018-04-12 11:35:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2018-04-12 11:35:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 2746 transitions. [2018-04-12 11:35:35,423 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 2746 transitions. Word has length 54 [2018-04-12 11:35:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:35,424 INFO L459 AbstractCegarLoop]: Abstraction has 2137 states and 2746 transitions. [2018-04-12 11:35:35,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 11:35:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2746 transitions. [2018-04-12 11:35:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-12 11:35:35,425 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:35,425 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-12 11:35:35,425 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-12 11:35:35,425 INFO L82 PathProgramCache]: Analyzing trace with hash -2029376545, now seen corresponding path program 1 times [2018-04-12 11:35:35,426 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:35,426 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:35,426 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:35,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:35,426 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:35,440 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:35,482 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-12 11:35:35,483 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 11:35:35,483 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 11:35:35,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:35,542 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 11:35:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-12 11:35:35,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 11:35:35,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2018-04-12 11:35:35,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 11:35:35,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 11:35:35,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-04-12 11:35:35,622 INFO L87 Difference]: Start difference. First operand 2137 states and 2746 transitions. Second operand 13 states. [2018-04-12 11:35:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:36,044 INFO L93 Difference]: Finished difference Result 2197 states and 2772 transitions. [2018-04-12 11:35:36,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 11:35:36,053 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-04-12 11:35:36,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:36,058 INFO L225 Difference]: With dead ends: 2197 [2018-04-12 11:35:36,058 INFO L226 Difference]: Without dead ends: 2097 [2018-04-12 11:35:36,059 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-04-12 11:35:36,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2018-04-12 11:35:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 2069. [2018-04-12 11:35:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2069 states. [2018-04-12 11:35:36,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 2614 transitions. [2018-04-12 11:35:36,082 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 2614 transitions. Word has length 54 [2018-04-12 11:35:36,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:36,082 INFO L459 AbstractCegarLoop]: Abstraction has 2069 states and 2614 transitions. [2018-04-12 11:35:36,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 11:35:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2614 transitions. [2018-04-12 11:35:36,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-12 11:35:36,083 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:36,083 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-12 11:35:36,083 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-12 11:35:36,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2017153842, now seen corresponding path program 1 times [2018-04-12 11:35:36,083 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:36,083 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:36,084 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:36,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:36,084 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:36,092 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:36,190 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-12 11:35:36,191 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 11:35:36,191 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 11:35:36,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:36,241 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 11:35:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-12 11:35:36,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 11:35:36,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-04-12 11:35:36,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 11:35:36,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 11:35:36,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-04-12 11:35:36,390 INFO L87 Difference]: Start difference. First operand 2069 states and 2614 transitions. Second operand 18 states. [2018-04-12 11:35:37,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:37,113 INFO L93 Difference]: Finished difference Result 5154 states and 6598 transitions. [2018-04-12 11:35:37,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 11:35:37,114 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-04-12 11:35:37,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:37,126 INFO L225 Difference]: With dead ends: 5154 [2018-04-12 11:35:37,127 INFO L226 Difference]: Without dead ends: 5074 [2018-04-12 11:35:37,127 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=305, Invalid=1255, Unknown=0, NotChecked=0, Total=1560 [2018-04-12 11:35:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2018-04-12 11:35:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 3195. [2018-04-12 11:35:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2018-04-12 11:35:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 3990 transitions. [2018-04-12 11:35:37,219 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 3990 transitions. Word has length 58 [2018-04-12 11:35:37,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:37,220 INFO L459 AbstractCegarLoop]: Abstraction has 3195 states and 3990 transitions. [2018-04-12 11:35:37,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 11:35:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 3990 transitions. [2018-04-12 11:35:37,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-12 11:35:37,221 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:37,221 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 11:35:37,221 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-12 11:35:37,222 INFO L82 PathProgramCache]: Analyzing trace with hash 328963835, now seen corresponding path program 1 times [2018-04-12 11:35:37,222 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:37,222 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:37,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:37,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:37,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:37,237 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-04-12 11:35:37,293 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 11:35:37,293 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 11:35:37,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:37,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 11:35:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 96 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-04-12 11:35:37,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 11:35:37,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-12 11:35:37,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 11:35:37,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 11:35:37,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-12 11:35:37,450 INFO L87 Difference]: Start difference. First operand 3195 states and 3990 transitions. Second operand 11 states. [2018-04-12 11:35:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:37,733 INFO L93 Difference]: Finished difference Result 3918 states and 4916 transitions. [2018-04-12 11:35:37,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 11:35:37,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2018-04-12 11:35:37,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:37,741 INFO L225 Difference]: With dead ends: 3918 [2018-04-12 11:35:37,741 INFO L226 Difference]: Without dead ends: 3822 [2018-04-12 11:35:37,742 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2018-04-12 11:35:37,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2018-04-12 11:35:37,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3694. [2018-04-12 11:35:37,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3694 states. [2018-04-12 11:35:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 4648 transitions. [2018-04-12 11:35:37,783 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 4648 transitions. Word has length 78 [2018-04-12 11:35:37,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:37,783 INFO L459 AbstractCegarLoop]: Abstraction has 3694 states and 4648 transitions. [2018-04-12 11:35:37,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 11:35:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 4648 transitions. [2018-04-12 11:35:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-12 11:35:37,784 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:37,784 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 11:35:37,784 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-12 11:35:37,784 INFO L82 PathProgramCache]: Analyzing trace with hash 797961657, now seen corresponding path program 1 times [2018-04-12 11:35:37,784 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:37,784 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:37,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:37,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:37,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:37,796 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-04-12 11:35:37,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 11:35:37,841 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 11:35:37,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:37,894 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 11:35:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-04-12 11:35:37,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 11:35:37,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-12 11:35:37,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 11:35:37,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 11:35:37,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-12 11:35:37,942 INFO L87 Difference]: Start difference. First operand 3694 states and 4648 transitions. Second operand 11 states. [2018-04-12 11:35:38,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:38,264 INFO L93 Difference]: Finished difference Result 4980 states and 6518 transitions. [2018-04-12 11:35:38,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 11:35:38,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2018-04-12 11:35:38,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:38,281 INFO L225 Difference]: With dead ends: 4980 [2018-04-12 11:35:38,281 INFO L226 Difference]: Without dead ends: 4976 [2018-04-12 11:35:38,282 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-04-12 11:35:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4976 states. [2018-04-12 11:35:38,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4976 to 3658. [2018-04-12 11:35:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3658 states. [2018-04-12 11:35:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 4620 transitions. [2018-04-12 11:35:38,345 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 4620 transitions. Word has length 80 [2018-04-12 11:35:38,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:38,346 INFO L459 AbstractCegarLoop]: Abstraction has 3658 states and 4620 transitions. [2018-04-12 11:35:38,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 11:35:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4620 transitions. [2018-04-12 11:35:38,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-12 11:35:38,347 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:38,347 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 11:35:38,348 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-12 11:35:38,348 INFO L82 PathProgramCache]: Analyzing trace with hash 623126807, now seen corresponding path program 1 times [2018-04-12 11:35:38,348 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:38,348 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:38,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:38,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:38,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:38,365 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 40 proven. 59 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-04-12 11:35:38,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 11:35:38,420 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 11:35:38,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:38,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 11:35:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 98 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-04-12 11:35:38,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 11:35:38,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-12 11:35:38,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 11:35:38,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 11:35:38,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-04-12 11:35:38,590 INFO L87 Difference]: Start difference. First operand 3658 states and 4620 transitions. Second operand 16 states. [2018-04-12 11:35:39,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:39,717 INFO L93 Difference]: Finished difference Result 8875 states and 11508 transitions. [2018-04-12 11:35:39,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-12 11:35:39,718 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2018-04-12 11:35:39,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:39,741 INFO L225 Difference]: With dead ends: 8875 [2018-04-12 11:35:39,741 INFO L226 Difference]: Without dead ends: 8875 [2018-04-12 11:35:39,742 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=572, Invalid=2850, Unknown=0, NotChecked=0, Total=3422 [2018-04-12 11:35:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8875 states. [2018-04-12 11:35:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8875 to 8122. [2018-04-12 11:35:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8122 states. [2018-04-12 11:35:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8122 states to 8122 states and 10498 transitions. [2018-04-12 11:35:39,862 INFO L78 Accepts]: Start accepts. Automaton has 8122 states and 10498 transitions. Word has length 81 [2018-04-12 11:35:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:39,862 INFO L459 AbstractCegarLoop]: Abstraction has 8122 states and 10498 transitions. [2018-04-12 11:35:39,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 11:35:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 8122 states and 10498 transitions. [2018-04-12 11:35:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-12 11:35:39,864 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:39,864 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 11:35:39,864 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-12 11:35:39,864 INFO L82 PathProgramCache]: Analyzing trace with hash -773348562, now seen corresponding path program 1 times [2018-04-12 11:35:39,865 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:39,865 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:39,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:39,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:39,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:39,882 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-04-12 11:35:39,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 11:35:39,969 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 11:35:39,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:40,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 11:35:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 99 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-04-12 11:35:40,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 11:35:40,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-04-12 11:35:40,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 11:35:40,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 11:35:40,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-04-12 11:35:40,139 INFO L87 Difference]: Start difference. First operand 8122 states and 10498 transitions. Second operand 18 states. [2018-04-12 11:35:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:43,021 INFO L93 Difference]: Finished difference Result 16854 states and 22104 transitions. [2018-04-12 11:35:43,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-12 11:35:43,022 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2018-04-12 11:35:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:43,063 INFO L225 Difference]: With dead ends: 16854 [2018-04-12 11:35:43,063 INFO L226 Difference]: Without dead ends: 16854 [2018-04-12 11:35:43,065 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4030 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1531, Invalid=10241, Unknown=0, NotChecked=0, Total=11772 [2018-04-12 11:35:43,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16854 states. [2018-04-12 11:35:43,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16854 to 15942. [2018-04-12 11:35:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2018-04-12 11:35:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 20894 transitions. [2018-04-12 11:35:43,271 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 20894 transitions. Word has length 93 [2018-04-12 11:35:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:43,271 INFO L459 AbstractCegarLoop]: Abstraction has 15942 states and 20894 transitions. [2018-04-12 11:35:43,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 11:35:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 20894 transitions. [2018-04-12 11:35:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-12 11:35:43,274 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:43,274 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 11:35:43,274 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-12 11:35:43,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1216421126, now seen corresponding path program 1 times [2018-04-12 11:35:43,274 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:43,274 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:43,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:43,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:43,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:43,291 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 100 proven. 7 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-04-12 11:35:43,417 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 11:35:43,417 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 11:35:43,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:43,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 11:35:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 97 proven. 21 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-04-12 11:35:43,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 11:35:43,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-04-12 11:35:43,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 11:35:43,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 11:35:43,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-04-12 11:35:43,707 INFO L87 Difference]: Start difference. First operand 15942 states and 20894 transitions. Second operand 19 states. [2018-04-12 11:35:44,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:44,309 INFO L93 Difference]: Finished difference Result 21008 states and 26902 transitions. [2018-04-12 11:35:44,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 11:35:44,311 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 95 [2018-04-12 11:35:44,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:44,359 INFO L225 Difference]: With dead ends: 21008 [2018-04-12 11:35:44,360 INFO L226 Difference]: Without dead ends: 21008 [2018-04-12 11:35:44,360 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=326, Invalid=1156, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 11:35:44,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21008 states. [2018-04-12 11:35:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21008 to 15737. [2018-04-12 11:35:44,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15737 states. [2018-04-12 11:35:44,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15737 states to 15737 states and 19946 transitions. [2018-04-12 11:35:44,621 INFO L78 Accepts]: Start accepts. Automaton has 15737 states and 19946 transitions. Word has length 95 [2018-04-12 11:35:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:44,621 INFO L459 AbstractCegarLoop]: Abstraction has 15737 states and 19946 transitions. [2018-04-12 11:35:44,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 11:35:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 15737 states and 19946 transitions. [2018-04-12 11:35:44,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-12 11:35:44,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:44,623 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-12 11:35:44,623 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-12 11:35:44,624 INFO L82 PathProgramCache]: Analyzing trace with hash 624469246, now seen corresponding path program 1 times [2018-04-12 11:35:44,624 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:44,624 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:44,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:44,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:44,625 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:44,640 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:44,791 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-12 11:35:44,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 11:35:44,791 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 11:35:44,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:44,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 11:35:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 86 proven. 23 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-04-12 11:35:44,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 11:35:44,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-04-12 11:35:44,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 11:35:44,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 11:35:44,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-04-12 11:35:44,978 INFO L87 Difference]: Start difference. First operand 15737 states and 19946 transitions. Second operand 19 states. [2018-04-12 11:35:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:45,945 INFO L93 Difference]: Finished difference Result 20177 states and 25900 transitions. [2018-04-12 11:35:45,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 11:35:45,945 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2018-04-12 11:35:45,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:45,991 INFO L225 Difference]: With dead ends: 20177 [2018-04-12 11:35:45,991 INFO L226 Difference]: Without dead ends: 19972 [2018-04-12 11:35:45,992 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=316, Invalid=1324, Unknown=0, NotChecked=0, Total=1640 [2018-04-12 11:35:46,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19972 states. [2018-04-12 11:35:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19972 to 16581. [2018-04-12 11:35:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16581 states. [2018-04-12 11:35:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16581 states to 16581 states and 20914 transitions. [2018-04-12 11:35:46,235 INFO L78 Accepts]: Start accepts. Automaton has 16581 states and 20914 transitions. Word has length 97 [2018-04-12 11:35:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:46,236 INFO L459 AbstractCegarLoop]: Abstraction has 16581 states and 20914 transitions. [2018-04-12 11:35:46,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 11:35:46,236 INFO L276 IsEmpty]: Start isEmpty. Operand 16581 states and 20914 transitions. [2018-04-12 11:35:46,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-04-12 11:35:46,238 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:46,238 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-12 11:35:46,238 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-12 11:35:46,238 INFO L82 PathProgramCache]: Analyzing trace with hash 695729250, now seen corresponding path program 1 times [2018-04-12 11:35:46,238 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:46,238 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:46,239 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:46,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:46,239 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:46,254 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:46,374 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-12 11:35:46,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 11:35:46,375 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 11:35:46,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:46,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 11:35:46,716 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-12 11:35:46,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 11:35:46,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-04-12 11:35:46,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 11:35:46,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 11:35:46,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-04-12 11:35:46,746 INFO L87 Difference]: Start difference. First operand 16581 states and 20914 transitions. Second operand 20 states. [2018-04-12 11:35:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:48,610 INFO L93 Difference]: Finished difference Result 24485 states and 30856 transitions. [2018-04-12 11:35:48,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-12 11:35:48,610 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 105 [2018-04-12 11:35:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:48,652 INFO L225 Difference]: With dead ends: 24485 [2018-04-12 11:35:48,652 INFO L226 Difference]: Without dead ends: 24485 [2018-04-12 11:35:48,653 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 115 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=450, Invalid=2000, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 11:35:48,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24485 states. [2018-04-12 11:35:48,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24485 to 23729. [2018-04-12 11:35:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23729 states. [2018-04-12 11:35:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23729 states to 23729 states and 29850 transitions. [2018-04-12 11:35:48,936 INFO L78 Accepts]: Start accepts. Automaton has 23729 states and 29850 transitions. Word has length 105 [2018-04-12 11:35:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:48,936 INFO L459 AbstractCegarLoop]: Abstraction has 23729 states and 29850 transitions. [2018-04-12 11:35:48,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 11:35:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 23729 states and 29850 transitions. [2018-04-12 11:35:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-04-12 11:35:48,942 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:48,942 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-12 11:35:48,942 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-12 11:35:48,942 INFO L82 PathProgramCache]: Analyzing trace with hash -250289914, now seen corresponding path program 1 times [2018-04-12 11:35:48,943 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:48,943 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:48,943 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:48,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:48,943 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:48,964 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 11:35:49,064 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-12 11:35:49,064 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 11:35:49,064 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 11:35:49,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 11:35:49,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 11:35:49,397 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-12 11:35:49,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 11:35:49,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-12 11:35:49,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 11:35:49,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 11:35:49,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-12 11:35:49,416 INFO L87 Difference]: Start difference. First operand 23729 states and 29850 transitions. Second operand 11 states. [2018-04-12 11:35:49,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 11:35:49,612 INFO L93 Difference]: Finished difference Result 25384 states and 31682 transitions. [2018-04-12 11:35:49,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-12 11:35:49,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 131 [2018-04-12 11:35:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 11:35:49,655 INFO L225 Difference]: With dead ends: 25384 [2018-04-12 11:35:49,655 INFO L226 Difference]: Without dead ends: 24804 [2018-04-12 11:35:49,655 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-12 11:35:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24804 states. [2018-04-12 11:35:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24804 to 23711. [2018-04-12 11:35:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23711 states. [2018-04-12 11:35:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23711 states to 23711 states and 29459 transitions. [2018-04-12 11:35:49,861 INFO L78 Accepts]: Start accepts. Automaton has 23711 states and 29459 transitions. Word has length 131 [2018-04-12 11:35:49,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 11:35:49,861 INFO L459 AbstractCegarLoop]: Abstraction has 23711 states and 29459 transitions. [2018-04-12 11:35:49,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 11:35:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 23711 states and 29459 transitions. [2018-04-12 11:35:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-04-12 11:35:49,865 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 11:35:49,865 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-12 11:35:49,865 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-12 11:35:49,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1889495301, now seen corresponding path program 1 times [2018-04-12 11:35:49,865 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 11:35:49,865 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 11:35:49,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:49,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 11:35:49,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 11:35:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-12 11:35:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-12 11:35:49,934 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-12 11:35:49,991 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-04-12 11:35:49,998 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-12 11:35:49,999 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-12 11:35:50,000 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-12 11:35:50,000 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-12 11:35:50,001 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-12 11:35:50,001 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-12 11:35:50,004 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-12 11:35:50,004 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-12 11:35:50,005 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-12 11:35:50,006 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-12 11:35:50,008 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-12 11:35:50,008 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-12 11:35:50,009 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-12 11:35:50,009 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-12 11:35:50,011 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-12 11:35:50,011 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-12 11:35:50,012 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-12 11:35:50,012 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-12 11:35:50,013 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-12 11:35:50,013 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-12 11:35:50,015 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-12 11:35:50,015 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-12 11:35:50,015 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-12 11:35:50,016 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-12 11:35:50,016 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-12 11:35:50,017 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-12 11:35:50,017 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-12 11:35:50,018 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-12 11:35:50,018 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-12 11:35:50,018 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-12 11:35:50,019 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-12 11:35:50,019 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-12 11:35:50,019 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-12 11:35:50,019 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-12 11:35:50,020 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-12 11:35:50,020 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-12 11:35:50,021 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-12 11:35:50,021 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-12 11:35:50,021 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-12 11:35:50,022 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-12 11:35:50,022 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-12 11:35:50,023 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-12 11:35:50,023 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-12 11:35:50,023 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-12 11:35:50,023 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-12 11:35:50,025 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-12 11:35:50,025 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-12 11:35:50,025 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-12 11:35:50,026 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-12 11:35:50,026 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-12 11:35:50,026 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-12 11:35:50,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 11:35:50 BoogieIcfgContainer [2018-04-12 11:35:50,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 11:35:50,041 INFO L168 Benchmark]: Toolchain (without parser) took 20804.26 ms. Allocated memory was 401.1 MB in the beginning and 1.3 GB in the end (delta: 885.0 MB). Free memory was 337.6 MB in the beginning and 739.0 MB in the end (delta: -401.4 MB). Peak memory consumption was 483.6 MB. Max. memory is 5.3 GB. [2018-04-12 11:35:50,042 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 401.1 MB. Free memory is still 361.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 11:35:50,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.11 ms. Allocated memory is still 401.1 MB. Free memory was 337.6 MB in the beginning and 311.1 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. [2018-04-12 11:35:50,042 INFO L168 Benchmark]: Boogie Preprocessor took 44.08 ms. Allocated memory is still 401.1 MB. Free memory was 311.1 MB in the beginning and 308.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-12 11:35:50,043 INFO L168 Benchmark]: RCFGBuilder took 438.22 ms. Allocated memory was 401.1 MB in the beginning and 610.3 MB in the end (delta: 209.2 MB). Free memory was 308.5 MB in the beginning and 537.9 MB in the end (delta: -229.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-04-12 11:35:50,043 INFO L168 Benchmark]: TraceAbstraction took 20070.94 ms. Allocated memory was 610.3 MB in the beginning and 1.3 GB in the end (delta: 675.8 MB). Free memory was 537.9 MB in the beginning and 739.0 MB in the end (delta: -201.1 MB). Peak memory consumption was 474.7 MB. Max. memory is 5.3 GB. [2018-04-12 11:35:50,045 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 401.1 MB. Free memory is still 361.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 248.11 ms. Allocated memory is still 401.1 MB. Free memory was 337.6 MB in the beginning and 311.1 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.08 ms. Allocated memory is still 401.1 MB. Free memory was 311.1 MB in the beginning and 308.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 438.22 ms. Allocated memory was 401.1 MB in the beginning and 610.3 MB in the end (delta: 209.2 MB). Free memory was 308.5 MB in the beginning and 537.9 MB in the end (delta: -229.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 20070.94 ms. Allocated memory was 610.3 MB in the beginning and 1.3 GB in the end (delta: 675.8 MB). Free memory was 537.9 MB in the beginning and 739.0 MB in the end (delta: -201.1 MB). Peak memory consumption was 474.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)=25, \old(S)=12, \old(t1)=24, \old(t1)=22, \old(t4)=13, \old(t4)=18, \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)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L632] COND FALSE !(case 1:) [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=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}] [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)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 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)=0, \old(x1)=10, \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)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L640] COND TRUE case 3: [L641] RET t1 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 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)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 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)=0, \old(x1)=10, \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)=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}] [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)=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}] [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)=0, \old(x1)=10, \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)=10, \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}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=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)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L637] COND FALSE !(case 2:) [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=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}] [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)=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}] [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)=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}] [L652] COND TRUE case 6: [L653] RET pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 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)=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={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)=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=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)=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, 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)=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, 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)=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, 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)=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, 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)=0, \old(t4)=10, \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)=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=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)=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}] [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)=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}] [L671] COND TRUE 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)=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)=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}, 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)=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, 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)=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=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)=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}] [L674] COND TRUE 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}] [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)=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={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, 20.0s OverallTime, 26 OverallIterations, 11 TraceHistogramMax, 12.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2738 SDtfs, 8256 SDslu, 7052 SDs, 0 SdLazy, 14547 SolverSat, 2104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1838 GetRequests, 1263 SyntacticMatches, 15 SemanticMatches, 560 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7363 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23729occurred in iteration=24, 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.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 16534 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2489 NumberOfCodeBlocks, 2489 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2303 ConstructedInterpolants, 10 QuantifiedInterpolants, 543643 SizeOfPredicates, 73 NumberOfNonLiveVariables, 8145 ConjunctsInSsa, 278 ConjunctsInUnsatCore, 41 InterpolantComputations, 11 PerfectInterpolantSequences, 2691/3234 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_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_11-35-50-053.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_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_11-35-50-053.csv Received shutdown request...