./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 869ef2ac3e655b6efbdfa5c05d637a0f622008da83d6042d15962fe695aee939 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 00:44:41,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 00:44:41,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 00:44:41,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 00:44:41,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 00:44:41,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 00:44:41,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 00:44:41,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 00:44:41,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 00:44:41,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 00:44:41,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 00:44:41,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 00:44:41,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 00:44:41,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 00:44:41,626 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 00:44:41,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 00:44:41,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 00:44:41,628 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 00:44:41,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 00:44:41,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 00:44:41,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 00:44:41,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 00:44:41,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 00:44:41,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 00:44:41,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 00:44:41,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 00:44:41,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 00:44:41,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 00:44:41,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 00:44:41,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 00:44:41,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 00:44:41,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 00:44:41,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:44:41,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 00:44:41,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 00:44:41,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 00:44:41,635 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 00:44:41,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 00:44:41,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 00:44:41,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 00:44:41,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 00:44:41,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 00:44:41,636 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 869ef2ac3e655b6efbdfa5c05d637a0f622008da83d6042d15962fe695aee939 [2024-11-22 00:44:41,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 00:44:41,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 00:44:41,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 00:44:41,903 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 00:44:41,905 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 00:44:41,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2024-11-22 00:44:43,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 00:44:43,656 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 00:44:43,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2024-11-22 00:44:43,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cd964035/7eaa67075d2c4a108df34cd6ea120b05/FLAGc6521bca4 [2024-11-22 00:44:43,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cd964035/7eaa67075d2c4a108df34cd6ea120b05 [2024-11-22 00:44:43,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 00:44:43,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 00:44:43,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 00:44:43,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 00:44:43,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 00:44:43,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:44:43" (1/1) ... [2024-11-22 00:44:43,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d4c7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:43, skipping insertion in model container [2024-11-22 00:44:43,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:44:43" (1/1) ... [2024-11-22 00:44:43,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 00:44:44,054 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25842,25855] [2024-11-22 00:44:44,061 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25967,25980] [2024-11-22 00:44:44,063 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[26082,26095] [2024-11-22 00:44:44,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:44:44,073 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 00:44:44,122 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25842,25855] [2024-11-22 00:44:44,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25967,25980] [2024-11-22 00:44:44,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[26082,26095] [2024-11-22 00:44:44,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:44:44,164 INFO L204 MainTranslator]: Completed translation [2024-11-22 00:44:44,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:44 WrapperNode [2024-11-22 00:44:44,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 00:44:44,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 00:44:44,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 00:44:44,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 00:44:44,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:44" (1/1) ... [2024-11-22 00:44:44,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:44" (1/1) ... [2024-11-22 00:44:44,226 INFO L138 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 140 [2024-11-22 00:44:44,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 00:44:44,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 00:44:44,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 00:44:44,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 00:44:44,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:44" (1/1) ... [2024-11-22 00:44:44,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:44" (1/1) ... [2024-11-22 00:44:44,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:44" (1/1) ... [2024-11-22 00:44:44,272 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [2, 20]. 91 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 7 writes are split as follows [0, 7]. [2024-11-22 00:44:44,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:44" (1/1) ... [2024-11-22 00:44:44,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:44" (1/1) ... [2024-11-22 00:44:44,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:44" (1/1) ... [2024-11-22 00:44:44,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:44" (1/1) ... [2024-11-22 00:44:44,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:44" (1/1) ... [2024-11-22 00:44:44,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:44" (1/1) ... [2024-11-22 00:44:44,293 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 00:44:44,294 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 00:44:44,294 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 00:44:44,294 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 00:44:44,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:44" (1/1) ... [2024-11-22 00:44:44,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:44:44,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:44,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 00:44:44,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 00:44:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-22 00:44:44,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-22 00:44:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2024-11-22 00:44:44,380 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2024-11-22 00:44:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 00:44:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2024-11-22 00:44:44,380 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2024-11-22 00:44:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 00:44:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 00:44:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 00:44:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-11-22 00:44:44,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-11-22 00:44:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 00:44:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 00:44:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 00:44:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 00:44:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 00:44:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 00:44:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 00:44:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-11-22 00:44:44,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-11-22 00:44:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 00:44:44,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 00:44:44,502 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 00:44:44,504 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 00:44:44,847 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-22 00:44:44,847 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 00:44:44,859 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 00:44:44,860 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 00:44:44,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:44:44 BoogieIcfgContainer [2024-11-22 00:44:44,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 00:44:44,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 00:44:44,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 00:44:44,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 00:44:44,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:44:43" (1/3) ... [2024-11-22 00:44:44,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5209c1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:44:44, skipping insertion in model container [2024-11-22 00:44:44,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:44" (2/3) ... [2024-11-22 00:44:44,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5209c1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:44:44, skipping insertion in model container [2024-11-22 00:44:44,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:44:44" (3/3) ... [2024-11-22 00:44:44,869 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_lock.i [2024-11-22 00:44:44,881 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 00:44:44,881 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 00:44:44,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 00:44:44,933 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1ef79b54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 00:44:44,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-22 00:44:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 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) [2024-11-22 00:44:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 00:44:44,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:44,944 INFO L215 NwaCegarLoop]: 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, 1] [2024-11-22 00:44:44,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:44,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:44,950 INFO L85 PathProgramCache]: Analyzing trace with hash 709034920, now seen corresponding path program 1 times [2024-11-22 00:44:44,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:44,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603787542] [2024-11-22 00:44:44,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:44,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 00:44:45,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:45,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603787542] [2024-11-22 00:44:45,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603787542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:44:45,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37512068] [2024-11-22 00:44:45,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:45,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:45,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:45,167 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:44:45,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 00:44:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:45,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 00:44:45,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:44:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 00:44:45,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:44:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37512068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:44:45,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 00:44:45,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 00:44:45,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748201014] [2024-11-22 00:44:45,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:44:45,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 00:44:45,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:45,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 00:44:45,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:44:45,333 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 00:44:45,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:45,362 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2024-11-22 00:44:45,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 00:44:45,364 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-11-22 00:44:45,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:45,370 INFO L225 Difference]: With dead ends: 136 [2024-11-22 00:44:45,370 INFO L226 Difference]: Without dead ends: 65 [2024-11-22 00:44:45,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:44:45,376 INFO L432 NwaCegarLoop]: 80 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, 80 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 [2024-11-22 00:44:45,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:44:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-22 00:44:45,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-22 00:44:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 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) [2024-11-22 00:44:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2024-11-22 00:44:45,409 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 28 [2024-11-22 00:44:45,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:45,409 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2024-11-22 00:44:45,409 INFO L472 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 00:44:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2024-11-22 00:44:45,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 00:44:45,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:45,411 INFO L215 NwaCegarLoop]: 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, 1] [2024-11-22 00:44:45,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 00:44:45,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 00:44:45,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:45,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:45,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2117471768, now seen corresponding path program 1 times [2024-11-22 00:44:45,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:45,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413416660] [2024-11-22 00:44:45,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:45,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 00:44:45,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:45,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413416660] [2024-11-22 00:44:45,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413416660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:44:45,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:44:45,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 00:44:45,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622355171] [2024-11-22 00:44:45,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:44:45,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 00:44:45,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:45,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 00:44:45,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:44:45,806 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2024-11-22 00:44:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:45,829 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-11-22 00:44:45,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:44:45,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 28 [2024-11-22 00:44:45,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:45,833 INFO L225 Difference]: With dead ends: 71 [2024-11-22 00:44:45,833 INFO L226 Difference]: Without dead ends: 69 [2024-11-22 00:44:45,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:44:45,835 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:45,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:44:45,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-22 00:44:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-22 00:44:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2024-11-22 00:44:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2024-11-22 00:44:45,854 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 28 [2024-11-22 00:44:45,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:45,855 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2024-11-22 00:44:45,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2024-11-22 00:44:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2024-11-22 00:44:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 00:44:45,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:45,857 INFO L215 NwaCegarLoop]: 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, 1] [2024-11-22 00:44:45,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 00:44:45,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:45,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:45,858 INFO L85 PathProgramCache]: Analyzing trace with hash -542868463, now seen corresponding path program 1 times [2024-11-22 00:44:45,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:45,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302107575] [2024-11-22 00:44:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:45,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 00:44:46,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:46,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302107575] [2024-11-22 00:44:46,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302107575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:44:46,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:44:46,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 00:44:46,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440559617] [2024-11-22 00:44:46,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:44:46,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:44:46,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:46,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:44:46,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:44:46,290 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 00:44:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:46,677 INFO L93 Difference]: Finished difference Result 195 states and 245 transitions. [2024-11-22 00:44:46,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 00:44:46,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 2 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 28 [2024-11-22 00:44:46,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:46,682 INFO L225 Difference]: With dead ends: 195 [2024-11-22 00:44:46,682 INFO L226 Difference]: Without dead ends: 134 [2024-11-22 00:44:46,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-22 00:44:46,686 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 81 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:46,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 217 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 00:44:46,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-22 00:44:46,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 111. [2024-11-22 00:44:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 83 states have internal predecessors, (93), 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) [2024-11-22 00:44:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2024-11-22 00:44:46,719 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 137 transitions. Word has length 28 [2024-11-22 00:44:46,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:46,719 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 137 transitions. [2024-11-22 00:44:46,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 00:44:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2024-11-22 00:44:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-22 00:44:46,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:46,725 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1] [2024-11-22 00:44:46,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 00:44:46,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:46,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:46,726 INFO L85 PathProgramCache]: Analyzing trace with hash 391053642, now seen corresponding path program 1 times [2024-11-22 00:44:46,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:46,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335503488] [2024-11-22 00:44:46,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:46,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-22 00:44:46,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:46,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335503488] [2024-11-22 00:44:46,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335503488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:44:46,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501969321] [2024-11-22 00:44:46,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:46,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:46,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:46,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:44:46,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 00:44:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:47,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 00:44:47,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:44:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-22 00:44:47,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:44:47,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501969321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:44:47,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 00:44:47,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-22 00:44:47,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427988525] [2024-11-22 00:44:47,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:44:47,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 00:44:47,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:47,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 00:44:47,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:44:47,041 INFO L87 Difference]: Start difference. First operand 111 states and 137 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) [2024-11-22 00:44:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:47,072 INFO L93 Difference]: Finished difference Result 201 states and 248 transitions. [2024-11-22 00:44:47,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:44:47,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 72 [2024-11-22 00:44:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:47,075 INFO L225 Difference]: With dead ends: 201 [2024-11-22 00:44:47,077 INFO L226 Difference]: Without dead ends: 117 [2024-11-22 00:44:47,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:44:47,078 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:47,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:44:47,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-22 00:44:47,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-22 00:44:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 87 states have internal predecessors, (98), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (27), 20 states have call predecessors, (27), 18 states have call successors, (27) [2024-11-22 00:44:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2024-11-22 00:44:47,104 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 72 [2024-11-22 00:44:47,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:47,106 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2024-11-22 00:44:47,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) [2024-11-22 00:44:47,107 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2024-11-22 00:44:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 00:44:47,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:47,110 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:44:47,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 00:44:47,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-22 00:44:47,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:47,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash 336841398, now seen corresponding path program 1 times [2024-11-22 00:44:47,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:47,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787481052] [2024-11-22 00:44:47,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:47,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 00:44:47,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 00:44:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 00:44:47,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 00:44:47,438 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 00:44:47,439 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-22 00:44:47,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-22 00:44:47,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-11-22 00:44:47,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 00:44:47,444 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-22 00:44:47,491 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 00:44:47,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:44:47 BoogieIcfgContainer [2024-11-22 00:44:47,495 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 00:44:47,496 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 00:44:47,496 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 00:44:47,496 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 00:44:47,496 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:44:44" (3/4) ... [2024-11-22 00:44:47,497 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 00:44:47,566 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 00:44:47,567 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 00:44:47,567 INFO L158 Benchmark]: Toolchain (without parser) took 3876.83ms. Allocated memory was 165.7MB in the beginning and 218.1MB in the end (delta: 52.4MB). Free memory was 114.6MB in the beginning and 74.1MB in the end (delta: 40.5MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. [2024-11-22 00:44:47,567 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 165.7MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 00:44:47,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.58ms. Allocated memory is still 165.7MB. Free memory was 114.1MB in the beginning and 92.1MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-22 00:44:47,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.33ms. Allocated memory is still 165.7MB. Free memory was 92.1MB in the beginning and 89.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:44:47,568 INFO L158 Benchmark]: Boogie Preprocessor took 63.49ms. Allocated memory is still 165.7MB. Free memory was 89.5MB in the beginning and 84.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 00:44:47,568 INFO L158 Benchmark]: RCFGBuilder took 569.59ms. Allocated memory is still 165.7MB. Free memory was 84.8MB in the beginning and 129.6MB in the end (delta: -44.9MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2024-11-22 00:44:47,568 INFO L158 Benchmark]: TraceAbstraction took 2630.23ms. Allocated memory was 165.7MB in the beginning and 218.1MB in the end (delta: 52.4MB). Free memory was 128.7MB in the beginning and 77.3MB in the end (delta: 51.5MB). Peak memory consumption was 106.7MB. Max. memory is 16.1GB. [2024-11-22 00:44:47,569 INFO L158 Benchmark]: Witness Printer took 71.10ms. Allocated memory is still 218.1MB. Free memory was 77.3MB in the beginning and 74.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:44:47,570 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 165.7MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.58ms. Allocated memory is still 165.7MB. Free memory was 114.1MB in the beginning and 92.1MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.33ms. Allocated memory is still 165.7MB. Free memory was 92.1MB in the beginning and 89.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.49ms. Allocated memory is still 165.7MB. Free memory was 89.5MB in the beginning and 84.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 569.59ms. Allocated memory is still 165.7MB. Free memory was 84.8MB in the beginning and 129.6MB in the end (delta: -44.9MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2630.23ms. Allocated memory was 165.7MB in the beginning and 218.1MB in the end (delta: 52.4MB). Free memory was 128.7MB in the beginning and 77.3MB in the end (delta: 51.5MB). Peak memory consumption was 106.7MB. Max. memory is 16.1GB. * Witness Printer took 71.10ms. Allocated memory is still 218.1MB. Free memory was 77.3MB in the beginning and 74.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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) }; [L665] struct ldv_list_head mutexes = { &(mutexes), &(mutexes) }; [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 [mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; VAL [\old(size)=8, \result={-1:0}, mutexes={3:0}] [L682] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [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 [mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; VAL [\old(size)=8, \result={-2:0}, mutexes={3:0}] [L683] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [m1={-1: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 [\old(e)={-1:0}, \old(s)={3:0}, mutexes={3:0}] [L654] struct ldv_list_element *m; [L655] EXPR (s)->next [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L655] { const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );} [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) [L655] COND FALSE !(&m->list != (s)) VAL [\old(e)={-1:0}, \old(s)={3:0}, e={-1:0}, mutexes={3:0}] [L660] return 0; VAL [\old(e)={-1:0}, \old(s)={3:0}, \result=0, e={-1:0}, mutexes={3:0}] [L669] RET ldv_is_in_set(m, &mutexes) VAL [\old(m)={-1:0}, m={-1: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 [\old(e)={-1:0}, \old(s)={3:0}, mutexes={3:0}] [L654] struct ldv_list_element *m; [L655] EXPR (s)->next [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L655] { const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );} [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) [L655] COND FALSE !(&m->list != (s)) VAL [\old(e)={-1:0}, \old(s)={3:0}, e={-1:0}, mutexes={3:0}] [L660] return 0; VAL [\old(e)={-1:0}, \old(s)={3:0}, \result=0, e={-1:0}, mutexes={3:0}] [L636] RET, EXPR ldv_is_in_set(new, s) VAL [mutexes={3:0}, new={-1:0}, s={3:0}] [L636] COND TRUE !ldv_is_in_set(new, s) [L637] struct ldv_list_element *le; VAL [mutexes={3:0}, new={-1: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 [mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; VAL [\old(size)=12, \result={-3:0}, mutexes={3:0}] [L638] RET, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) VAL [mutexes={3:0}, new={-1: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 [\old(m)={-1:0}, mutexes={3:0}] [L608] CALL __ldv_list_add(new, head, head->next) VAL [\old(new)={-3:4}, \old(next)={3:0}, \old(prev)={3:0}, mutexes={3:0}] [L596] next->prev = new [L597] new->next = next [L598] new->prev = prev [L599] prev->next = new VAL [\old(new)={-3:4}, \old(next)={3:0}, \old(prev)={3:0}, mutexes={3:0}] [L608] RET __ldv_list_add(new, head, head->next) VAL [head={3:0}, mutexes={3:0}, new={-3:4}] [L640] RET ldv_list_add(&le->list, s) [L670] RET ldv_set_add(m, &mutexes) [L684] RET mutex_lock(m1) VAL [m1={-1:0}, m2={-2:0}, mutexes={3:0}] [L685] CALL mutex_lock(m1) VAL [mutexes={3:0}] [L669] CALL ldv_is_in_set(m, &mutexes) VAL [\old(e)={-1:0}, \old(s)={3:0}, mutexes={3:0}] [L654] struct ldv_list_element *m; [L655] EXPR (s)->next [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L655] { const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );} [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) [L655] COND TRUE &m->list != (s) [L656] EXPR m->e VAL [\old(e)={-1:0}, \old(s)={3:0}, e={-1:0}, m={-3:0}, mutexes={3:0}, s={3:0}] [L656] COND TRUE m->e == e [L657] return 1; VAL [\old(e)={-1:0}, \old(s)={3:0}, \result=1, m={-3:0}, mutexes={3:0}, s={3:0}] [L669] RET ldv_is_in_set(m, &mutexes) VAL [\old(m)={-1:0}, m={-1:0}, mutexes={3:0}] [L669] COND TRUE ldv_is_in_set(m, &mutexes) [L669] reach_error() VAL [\old(m)={-1:0}, m={-1:0}, mutexes={3:0}] - UnprovableResult [Line: 673]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 677]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 70 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 727 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 430 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 297 mSDtfsCounter, 129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=4, InterpolantAutomatonStates: 19, 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, 4 MinimizatonAttempts, 23 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 470 SizeOfPredicates, 0 NumberOfNonLiveVariables, 539 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 138/152 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! [2024-11-22 00:44:47,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE