/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:06:21,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:06:21,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:06:21,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:06:21,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:06:21,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:06:21,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:06:21,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:06:21,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:06:21,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:06:21,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:06:21,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:06:21,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:06:21,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:06:21,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:06:21,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:06:21,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:06:21,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:06:21,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:06:21,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:06:21,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:06:21,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:06:21,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:06:21,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:06:21,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:06:21,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:06:21,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:06:21,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:06:21,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:06:21,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:06:21,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:06:21,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:06:21,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:06:21,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:06:21,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:06:21,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:06:21,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:06:21,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:06:21,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:06:21,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:06:21,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:06:21,248 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 06:06:21,279 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:06:21,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:06:21,280 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:06:21,280 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:06:21,280 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:06:21,281 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:06:21,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:06:21,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:06:21,281 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:06:21,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:06:21,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:06:21,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:06:21,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:06:21,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:06:21,282 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:06:21,282 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:06:21,282 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:06:21,282 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:06:21,282 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:06:21,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:06:21,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:06:21,283 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:06:21,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:06:21,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:06:21,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:06:21,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:06:21,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:06:21,283 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:06:21,284 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:06:21,284 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:06:21,284 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:06:21,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:06:21,284 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:06:21,284 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 06:06:21,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:06:21,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:06:21,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:06:21,498 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:06:21,505 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:06:21,506 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i [2022-01-10 06:06:21,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba44660e/ab18b731b5e04245bfcc888804a5c934/FLAGe128fc61e [2022-01-10 06:06:22,001 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:06:22,001 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i [2022-01-10 06:06:22,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba44660e/ab18b731b5e04245bfcc888804a5c934/FLAGe128fc61e [2022-01-10 06:06:22,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba44660e/ab18b731b5e04245bfcc888804a5c934 [2022-01-10 06:06:22,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:06:22,026 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:06:22,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:06:22,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:06:22,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:06:22,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:06:22" (1/1) ... [2022-01-10 06:06:22,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a30516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:06:22, skipping insertion in model container [2022-01-10 06:06:22,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:06:22" (1/1) ... [2022-01-10 06:06:22,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:06:22,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:06:22,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[25842,25855] [2022-01-10 06:06:22,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[25967,25980] [2022-01-10 06:06:22,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[26082,26095] [2022-01-10 06:06:22,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:06:22,376 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-10 06:06:22,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:06:22,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[25842,25855] [2022-01-10 06:06:22,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[25967,25980] [2022-01-10 06:06:22,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[26082,26095] [2022-01-10 06:06:22,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:06:22,439 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:06:22,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[25842,25855] [2022-01-10 06:06:22,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[25967,25980] [2022-01-10 06:06:22,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[26082,26095] [2022-01-10 06:06:22,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:06:22,506 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:06:22,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:06:22 WrapperNode [2022-01-10 06:06:22,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:06:22,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:06:22,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:06:22,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:06:22,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:06:22" (1/1) ... [2022-01-10 06:06:22,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:06:22" (1/1) ... [2022-01-10 06:06:22,544 INFO L137 Inliner]: procedures = 140, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 125 [2022-01-10 06:06:22,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:06:22,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:06:22,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:06:22,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:06:22,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:06:22" (1/1) ... [2022-01-10 06:06:22,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:06:22" (1/1) ... [2022-01-10 06:06:22,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:06:22" (1/1) ... [2022-01-10 06:06:22,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:06:22" (1/1) ... [2022-01-10 06:06:22,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:06:22" (1/1) ... [2022-01-10 06:06:22,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:06:22" (1/1) ... [2022-01-10 06:06:22,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:06:22" (1/1) ... [2022-01-10 06:06:22,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:06:22,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:06:22,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:06:22,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:06:22,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:06:22" (1/1) ... [2022-01-10 06:06:22,593 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:06:22,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:06:22,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 06:06:22,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 06:06:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-01-10 06:06:22,662 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-01-10 06:06:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-01-10 06:06:22,662 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-01-10 06:06:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:06:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-01-10 06:06:22,662 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-01-10 06:06:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:06:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:06:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-01-10 06:06:22,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-01-10 06:06:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:06:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:06:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 06:06:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:06:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2022-01-10 06:06:22,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2022-01-10 06:06:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:06:22,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:06:22,767 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:06:22,768 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:06:23,071 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:06:23,076 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:06:23,076 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 06:06:23,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:06:23 BoogieIcfgContainer [2022-01-10 06:06:23,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:06:23,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:06:23,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:06:23,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:06:23,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:06:22" (1/3) ... [2022-01-10 06:06:23,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8de0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:06:23, skipping insertion in model container [2022-01-10 06:06:23,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:06:22" (2/3) ... [2022-01-10 06:06:23,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8de0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:06:23, skipping insertion in model container [2022-01-10 06:06:23,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:06:23" (3/3) ... [2022-01-10 06:06:23,084 INFO L111 eAbstractionObserver]: Analyzing ICFG test_mutex_double_lock.i [2022-01-10 06:06:23,088 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:06:23,088 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-10 06:06:23,120 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:06:23,125 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 06:06:23,126 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-10 06:06:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-10 06:06:23,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 06:06:23,164 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:06:23,164 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:06:23,165 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:06:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:06:23,169 INFO L85 PathProgramCache]: Analyzing trace with hash 673246785, now seen corresponding path program 1 times [2022-01-10 06:06:23,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:06:23,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795771274] [2022-01-10 06:06:23,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:06:23,191 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:06:23,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:06:23,194 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:06:23,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 06:06:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:06:23,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:06:23,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:06:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 06:06:23,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:06:23,431 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:06:23,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795771274] [2022-01-10 06:06:23,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795771274] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:06:23,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:06:23,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:06:23,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405239465] [2022-01-10 06:06:23,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:06:23,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:06:23,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:06:23,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:06:23,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:06:23,465 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 06:06:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:06:23,486 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2022-01-10 06:06:23,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:06:23,487 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-01-10 06:06:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:06:23,492 INFO L225 Difference]: With dead ends: 130 [2022-01-10 06:06:23,493 INFO L226 Difference]: Without dead ends: 62 [2022-01-10 06:06:23,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:06:23,497 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:06:23,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:06:23,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-10 06:06:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-01-10 06:06:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-10 06:06:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-01-10 06:06:23,531 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 27 [2022-01-10 06:06:23,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:06:23,531 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-01-10 06:06:23,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 06:06:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-01-10 06:06:23,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 06:06:23,532 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:06:23,532 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:06:23,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 06:06:23,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:06:23,734 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:06:23,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:06:23,735 INFO L85 PathProgramCache]: Analyzing trace with hash -387762175, now seen corresponding path program 1 times [2022-01-10 06:06:23,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:06:23,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745635127] [2022-01-10 06:06:23,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:06:23,736 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:06:23,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:06:23,755 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:06:23,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 06:06:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:06:23,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 06:06:23,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:06:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 06:06:24,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:06:24,329 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:06:24,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745635127] [2022-01-10 06:06:24,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745635127] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:06:24,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:06:24,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:06:24,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982718022] [2022-01-10 06:06:24,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:06:24,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:06:24,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:06:24,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:06:24,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:06:24,332 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 06:06:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:06:24,757 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2022-01-10 06:06:24,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:06:24,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-01-10 06:06:24,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:06:24,761 INFO L225 Difference]: With dead ends: 170 [2022-01-10 06:06:24,761 INFO L226 Difference]: Without dead ends: 116 [2022-01-10 06:06:24,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:06:24,762 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 63 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 06:06:24,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 184 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 06:06:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-01-10 06:06:24,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2022-01-10 06:06:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (23), 17 states have call predecessors, (23), 18 states have call successors, (23) [2022-01-10 06:06:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2022-01-10 06:06:24,775 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 27 [2022-01-10 06:06:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:06:24,775 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2022-01-10 06:06:24,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 06:06:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2022-01-10 06:06:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 06:06:24,776 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:06:24,776 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:06:24,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 06:06:24,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:06:24,985 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:06:24,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:06:24,986 INFO L85 PathProgramCache]: Analyzing trace with hash -438555830, now seen corresponding path program 1 times [2022-01-10 06:06:24,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:06:24,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749594894] [2022-01-10 06:06:24,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:06:24,986 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:06:24,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:06:24,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:06:24,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 06:06:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:06:25,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:06:25,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:06:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 06:06:25,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:06:25,146 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:06:25,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749594894] [2022-01-10 06:06:25,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749594894] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:06:25,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:06:25,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:06:25,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120729222] [2022-01-10 06:06:25,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:06:25,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:06:25,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:06:25,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:06:25,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:06:25,149 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 06:06:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:06:25,166 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2022-01-10 06:06:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 06:06:25,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-01-10 06:06:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:06:25,167 INFO L225 Difference]: With dead ends: 108 [2022-01-10 06:06:25,168 INFO L226 Difference]: Without dead ends: 106 [2022-01-10 06:06:25,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:06:25,169 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:06:25,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:06:25,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-01-10 06:06:25,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-01-10 06:06:25,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 76 states have internal predecessors, (86), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (26), 18 states have call predecessors, (26), 18 states have call successors, (26) [2022-01-10 06:06:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2022-01-10 06:06:25,178 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 27 [2022-01-10 06:06:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:06:25,179 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2022-01-10 06:06:25,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 06:06:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2022-01-10 06:06:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 06:06:25,180 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:06:25,181 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 06:06:25,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 06:06:25,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:06:25,388 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:06:25,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:06:25,389 INFO L85 PathProgramCache]: Analyzing trace with hash -811626959, now seen corresponding path program 1 times [2022-01-10 06:06:25,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:06:25,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161904381] [2022-01-10 06:06:25,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:06:25,389 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:06:25,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:06:25,391 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:06:25,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 06:06:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:06:25,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjunts are in the unsatisfiable core [2022-01-10 06:06:25,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:06:25,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-10 06:06:25,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-10 06:06:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-10 06:06:26,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:06:26,157 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:06:26,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161904381] [2022-01-10 06:06:26,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161904381] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:06:26,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:06:26,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 06:06:26,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012928305] [2022-01-10 06:06:26,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:06:26,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 06:06:26,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:06:26,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 06:06:26,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-10 06:06:26,159 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 06:06:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:06:27,943 INFO L93 Difference]: Finished difference Result 268 states and 338 transitions. [2022-01-10 06:06:27,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 06:06:27,943 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 67 [2022-01-10 06:06:27,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:06:27,945 INFO L225 Difference]: With dead ends: 268 [2022-01-10 06:06:27,946 INFO L226 Difference]: Without dead ends: 162 [2022-01-10 06:06:27,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-01-10 06:06:27,947 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 241 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 06:06:27,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 312 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 06:06:27,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-01-10 06:06:27,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2022-01-10 06:06:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 19 states have call successors, (19), 10 states have call predecessors, (19), 14 states have return successors, (32), 19 states have call predecessors, (32), 19 states have call successors, (32) [2022-01-10 06:06:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2022-01-10 06:06:27,959 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 67 [2022-01-10 06:06:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:06:27,959 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2022-01-10 06:06:27,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 06:06:27,960 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2022-01-10 06:06:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 06:06:27,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:06:27,961 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 06:06:27,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 06:06:28,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:06:28,174 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:06:28,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:06:28,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1108503363, now seen corresponding path program 1 times [2022-01-10 06:06:28,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:06:28,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353280725] [2022-01-10 06:06:28,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:06:28,175 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:06:28,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:06:28,176 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:06:28,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 06:06:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:06:28,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:06:28,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:06:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 06:06:28,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:06:28,387 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:06:28,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353280725] [2022-01-10 06:06:28,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353280725] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:06:28,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:06:28,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:06:28,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618750380] [2022-01-10 06:06:28,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:06:28,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:06:28,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:06:28,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:06:28,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:06:28,389 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-10 06:06:28,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:06:28,399 INFO L93 Difference]: Finished difference Result 196 states and 237 transitions. [2022-01-10 06:06:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 06:06:28,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2022-01-10 06:06:28,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:06:28,400 INFO L225 Difference]: With dead ends: 196 [2022-01-10 06:06:28,400 INFO L226 Difference]: Without dead ends: 109 [2022-01-10 06:06:28,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:06:28,401 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:06:28,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:06:28,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-10 06:06:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-01-10 06:06:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2022-01-10 06:06:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2022-01-10 06:06:28,409 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 67 [2022-01-10 06:06:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:06:28,409 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2022-01-10 06:06:28,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-10 06:06:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2022-01-10 06:06:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 06:06:28,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:06:28,410 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:06:28,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 06:06:28,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:06:28,622 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:06:28,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:06:28,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1210243856, now seen corresponding path program 1 times [2022-01-10 06:06:28,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:06:28,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214108887] [2022-01-10 06:06:28,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:06:28,624 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:06:28,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:06:28,626 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:06:28,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 06:06:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 06:06:28,929 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 06:06:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 06:06:29,291 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 06:06:29,291 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 06:06:29,292 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-10 06:06:29,293 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-10 06:06:29,293 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-10 06:06:29,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 06:06:29,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:06:29,496 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-01-10 06:06:29,499 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 06:06:29,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:06:29 BoogieIcfgContainer [2022-01-10 06:06:29,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 06:06:29,548 INFO L158 Benchmark]: Toolchain (without parser) took 7522.08ms. Allocated memory was 169.9MB in the beginning and 222.3MB in the end (delta: 52.4MB). Free memory was 112.8MB in the beginning and 176.1MB in the end (delta: -63.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:06:29,548 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 169.9MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:06:29,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.51ms. Allocated memory is still 169.9MB. Free memory was 112.6MB in the beginning and 125.8MB in the end (delta: -13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-10 06:06:29,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.75ms. Allocated memory is still 169.9MB. Free memory was 125.8MB in the beginning and 123.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:06:29,549 INFO L158 Benchmark]: Boogie Preprocessor took 36.64ms. Allocated memory is still 169.9MB. Free memory was 123.3MB in the beginning and 121.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:06:29,549 INFO L158 Benchmark]: RCFGBuilder took 496.25ms. Allocated memory is still 169.9MB. Free memory was 121.0MB in the beginning and 103.4MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-01-10 06:06:29,559 INFO L158 Benchmark]: TraceAbstraction took 6468.74ms. Allocated memory was 169.9MB in the beginning and 222.3MB in the end (delta: 52.4MB). Free memory was 102.9MB in the beginning and 176.1MB in the end (delta: -73.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:06:29,560 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 169.9MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 477.51ms. Allocated memory is still 169.9MB. Free memory was 112.6MB in the beginning and 125.8MB in the end (delta: -13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.75ms. Allocated memory is still 169.9MB. Free memory was 125.8MB in the beginning and 123.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.64ms. Allocated memory is still 169.9MB. Free memory was 123.3MB in the beginning and 121.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 496.25ms. Allocated memory is still 169.9MB. Free memory was 121.0MB in the beginning and 103.4MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 6468.74ms. Allocated memory was 169.9MB in the beginning and 222.3MB in the end (delta: 52.4MB). Free memory was 102.9MB in the beginning and 176.1MB in the end (delta: -73.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 669]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L665] struct ldv_list_head mutexes = { &(mutexes), &(mutexes) }; VAL [mutexes={3:0}] [L692] CALL foo() [L681] FCALL ldv_initialize() [L682] CALL, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [mutexes={3:0}] [L576] void *ptr = malloc(size); [L577] CALL assume_abort_if_not(ptr!=0) [L565] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; VAL [\old(size)=8, \result={6:0}, mutexes={3:0}, ptr={6:0}, size=8] [L682] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [ldv_successful_malloc(sizeof(struct mutex))={6:0}, mutexes={3:0}] [L682] struct mutex *m1 = ldv_successful_malloc(sizeof(struct mutex)); [L683] CALL, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [mutexes={3:0}] [L576] void *ptr = malloc(size); [L577] CALL assume_abort_if_not(ptr!=0) [L565] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; VAL [\old(size)=8, \result={5:0}, mutexes={3:0}, ptr={5:0}, size=8] [L683] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [ldv_successful_malloc(sizeof(struct mutex))={5:0}, m1={6:0}, mutexes={3:0}] [L683] struct mutex *m2 = ldv_successful_malloc(sizeof(struct mutex)); [L684] CALL mutex_lock(m1) VAL [mutexes={3:0}] [L669] CALL ldv_is_in_set(m, &mutexes) VAL [e={6:0}, mutexes={3:0}, s={3:0}] [L654] struct ldv_list_element *m; [L655] EXPR (s)->next [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={3:0}, e={6:0}, e={6:0}, m={3:-8}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] COND FALSE !(&m->list != (s)) VAL [__mptr={3:0}, e={6:0}, e={6:0}, m={3:-8}, mutexes={3:0}, s={3:0}, s={3:0}] [L660] return 0; VAL [\result=0, __mptr={3:0}, e={6:0}, e={6:0}, m={3:-8}, mutexes={3:0}, s={3:0}, s={3:0}] [L669] RET ldv_is_in_set(m, &mutexes) VAL [ldv_is_in_set(m, &mutexes)=0, m={6:0}, m={6:0}, mutexes={3:0}] [L669] COND FALSE !(ldv_is_in_set(m, &mutexes)) [L670] CALL ldv_set_add(m, &mutexes) [L636] CALL, EXPR ldv_is_in_set(new, s) VAL [e={6:0}, mutexes={3:0}, s={3:0}] [L654] struct ldv_list_element *m; [L655] EXPR (s)->next [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={3:0}, e={6:0}, e={6:0}, m={3:-8}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] COND FALSE !(&m->list != (s)) VAL [__mptr={3:0}, e={6:0}, e={6:0}, m={3:-8}, mutexes={3:0}, s={3:0}, s={3:0}] [L660] return 0; VAL [\result=0, __mptr={3:0}, e={6:0}, e={6:0}, m={3:-8}, mutexes={3:0}, s={3:0}, s={3:0}] [L636] RET, EXPR ldv_is_in_set(new, s) VAL [ldv_is_in_set(new, s)=0, mutexes={3:0}, new={6:0}, new={6:0}, s={3:0}, s={3:0}] [L636] COND TRUE !ldv_is_in_set(new, s) [L637] struct ldv_list_element *le; VAL [mutexes={3:0}, new={6:0}, new={6:0}, s={3:0}, s={3:0}] [L638] CALL, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) VAL [mutexes={3:0}] [L576] void *ptr = malloc(size); [L577] CALL assume_abort_if_not(ptr!=0) [L565] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; VAL [\old(size)=24, \result={7:0}, mutexes={3:0}, ptr={7:0}, size=24] [L638] RET, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) VAL [ldv_successful_malloc(sizeof(struct ldv_list_element))={7:0}, mutexes={3:0}, new={6:0}, new={6:0}, s={3:0}, s={3:0}] [L638] le = (struct ldv_list_element*)ldv_successful_malloc(sizeof(struct ldv_list_element)) [L639] le->e = new [L640] CALL ldv_list_add(&le->list, s) [L608] EXPR head->next VAL [head={3:0}, head={3:0}, head->next={3:0}, mutexes={3:0}, new={7:8}, new={7:8}] [L608] CALL __ldv_list_add(new, head, head->next) VAL [mutexes={3:0}, new={7:8}, next={3:0}, prev={3:0}] [L596] next->prev = new [L597] new->next = next [L598] new->prev = prev [L599] prev->next = new VAL [mutexes={3:0}, new={7:8}, new={7:8}, next={3:0}, next={3:0}, prev={3:0}, prev={3:0}] [L608] RET __ldv_list_add(new, head, head->next) VAL [head={3:0}, head={3:0}, head->next={3:0}, mutexes={3:0}, new={7:8}, new={7:8}] [L640] RET ldv_list_add(&le->list, s) [L670] RET ldv_set_add(m, &mutexes) [L684] RET mutex_lock(m1) VAL [m1={6:0}, m2={5:0}, mutexes={3:0}] [L685] CALL mutex_lock(m1) VAL [mutexes={3:0}] [L669] CALL ldv_is_in_set(m, &mutexes) VAL [e={6:0}, mutexes={3:0}, s={3:0}] [L654] struct ldv_list_element *m; [L655] EXPR (s)->next [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={7:8}, e={6:0}, e={6:0}, m={7:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] COND TRUE &m->list != (s) [L656] EXPR m->e VAL [__mptr={7:8}, e={6:0}, e={6:0}, m={7:0}, m->e={6:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L656] COND TRUE m->e == e [L657] return 1; VAL [\result=1, __mptr={7:8}, e={6:0}, e={6:0}, m={7:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L669] RET ldv_is_in_set(m, &mutexes) VAL [ldv_is_in_set(m, &mutexes)=1, m={6:0}, m={6:0}, mutexes={3:0}] [L669] COND TRUE ldv_is_in_set(m, &mutexes) [L669] reach_error() VAL [m={6:0}, m={6:0}, mutexes={3:0}] - UnprovableResult [Line: 673]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 677]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 67 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 318 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 304 mSDsluCounter, 1000 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 619 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 490 IncrementalHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 381 mSDtfsCounter, 490 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=4, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 63 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 1244 SizeOfPredicates, 22 NumberOfNonLiveVariables, 798 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 137/137 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 06:06:29,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...