./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 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 ../../../trunk/examples/svcomp/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 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:44:33,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:44:33,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 21:44:33,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:44:33,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:44:33,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:44:33,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:44:33,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:44:33,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:44:33,688 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:44:33,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:44:33,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:44:33,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:44:33,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:44:33,691 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:44:33,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:44:33,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:44:33,692 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 21:44:33,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 21:44:33,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 21:44:33,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:44:33,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:44:33,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:44:33,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:44:33,694 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 21:44:33,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:44:33,694 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:44:33,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:44:33,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:44:33,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:44:33,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:44:33,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:44:33,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:44:33,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:44:33,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:44:33,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 21:44:33,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 21:44:33,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:44:33,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:44:33,698 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:44:33,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:44:33,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:44:33,699 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 21:44:34,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:44:34,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:44:34,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:44:34,037 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:44:34,037 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:44:34,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i [2023-11-22 21:44:35,213 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:44:35,483 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:44:35,484 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i [2023-11-22 21:44:35,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33c251b45/4f37923e3ce34680bc32416974d03f58/FLAGd2785eabc [2023-11-22 21:44:35,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33c251b45/4f37923e3ce34680bc32416974d03f58 [2023-11-22 21:44:35,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:44:35,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:44:35,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:44:35,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:44:35,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:44:35,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:44:35" (1/1) ... [2023-11-22 21:44:35,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42376701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:35, skipping insertion in model container [2023-11-22 21:44:35,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:44:35" (1/1) ... [2023-11-22 21:44:35,581 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:44:35,941 WARN L240 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] [2023-11-22 21:44:35,953 WARN L240 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] [2023-11-22 21:44:35,955 WARN L240 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] [2023-11-22 21:44:35,959 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:44:35,971 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:44:36,040 WARN L240 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] [2023-11-22 21:44:36,044 WARN L240 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] [2023-11-22 21:44:36,045 WARN L240 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] [2023-11-22 21:44:36,048 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:44:36,087 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:44:36,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:36 WrapperNode [2023-11-22 21:44:36,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:44:36,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:44:36,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:44:36,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:44:36,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:36" (1/1) ... [2023-11-22 21:44:36,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:36" (1/1) ... [2023-11-22 21:44:36,140 INFO L138 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 138 [2023-11-22 21:44:36,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:44:36,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:44:36,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:44:36,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:44:36,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:36" (1/1) ... [2023-11-22 21:44:36,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:36" (1/1) ... [2023-11-22 21:44:36,171 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:36" (1/1) ... [2023-11-22 21:44:36,202 INFO L189 HeapSplitter]: Split 22 memory accesses to 2 slices as follows [2, 20] [2023-11-22 21:44:36,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:36" (1/1) ... [2023-11-22 21:44:36,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:36" (1/1) ... [2023-11-22 21:44:36,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:36" (1/1) ... [2023-11-22 21:44:36,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:36" (1/1) ... [2023-11-22 21:44:36,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:36" (1/1) ... [2023-11-22 21:44:36,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:36" (1/1) ... [2023-11-22 21:44:36,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:44:36,231 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:44:36,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:44:36,232 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:44:36,233 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:36" (1/1) ... [2023-11-22 21:44:36,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:44:36,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:44:36,278 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) [2023-11-22 21:44:36,280 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 [2023-11-22 21:44:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-11-22 21:44:36,325 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-11-22 21:44:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2023-11-22 21:44:36,325 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2023-11-22 21:44:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 21:44:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-11-22 21:44:36,326 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-11-22 21:44:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:44:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-22 21:44:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-22 21:44:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-11-22 21:44:36,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-11-22 21:44:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-22 21:44:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-22 21:44:36,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 21:44:36,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-22 21:44:36,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-22 21:44:36,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 21:44:36,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-22 21:44:36,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-11-22 21:44:36,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-11-22 21:44:36,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:44:36,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:44:36,487 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:44:36,493 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:44:36,760 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:44:36,851 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:44:36,856 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 21:44:36,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:44:36 BoogieIcfgContainer [2023-11-22 21:44:36,857 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:44:36,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:44:36,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:44:36,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:44:36,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:44:35" (1/3) ... [2023-11-22 21:44:36,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e29127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:44:36, skipping insertion in model container [2023-11-22 21:44:36,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:36" (2/3) ... [2023-11-22 21:44:36,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e29127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:44:36, skipping insertion in model container [2023-11-22 21:44:36,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:44:36" (3/3) ... [2023-11-22 21:44:36,867 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_lock.i [2023-11-22 21:44:36,886 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:44:36,886 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-22 21:44:36,926 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:44:36,932 INFO L357 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=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;@29261552, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:44:36,932 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-22 21:44:36,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 35 states have (on average 1.4) internal successors, (49), 38 states have internal predecessors, (49), 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) [2023-11-22 21:44:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-22 21:44:36,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:44:36,946 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:44:36,947 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:44:36,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:44:36,953 INFO L85 PathProgramCache]: Analyzing trace with hash 771595544, now seen corresponding path program 1 times [2023-11-22 21:44:36,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:44:36,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255818774] [2023-11-22 21:44:36,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:44:36,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:44:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:44:37,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:44:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:44:37,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:44:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:44:37,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-22 21:44:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:44:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:44:37,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:44:37,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255818774] [2023-11-22 21:44:37,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255818774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:44:37,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:44:37,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:44:37,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776026579] [2023-11-22 21:44:37,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:44:37,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:44:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:44:37,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:44:37,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:44:37,316 INFO L87 Difference]: Start difference. First operand has 55 states, 35 states have (on average 1.4) internal successors, (49), 38 states have internal predecessors, (49), 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 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 21:44:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:44:37,478 INFO L93 Difference]: Finished difference Result 115 states and 161 transitions. [2023-11-22 21:44:37,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:44:37,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-11-22 21:44:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:44:37,490 INFO L225 Difference]: With dead ends: 115 [2023-11-22 21:44:37,490 INFO L226 Difference]: Without dead ends: 60 [2023-11-22 21:44:37,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:44:37,498 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 29 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:44:37,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 43 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:44:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-22 21:44:37,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2023-11-22 21:44:37,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 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) [2023-11-22 21:44:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2023-11-22 21:44:37,548 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 24 [2023-11-22 21:44:37,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:44:37,548 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2023-11-22 21:44:37,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 21:44:37,549 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2023-11-22 21:44:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-22 21:44:37,550 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:44:37,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:44:37,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 21:44:37,552 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:44:37,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:44:37,553 INFO L85 PathProgramCache]: Analyzing trace with hash -85566308, now seen corresponding path program 1 times [2023-11-22 21:44:37,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:44:37,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883307030] [2023-11-22 21:44:37,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:44:37,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:44:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:44:37,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:44:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:44:37,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:44:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:44:37,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-22 21:44:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:44:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:44:37,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:44:37,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883307030] [2023-11-22 21:44:37,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883307030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:44:37,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:44:37,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 21:44:37,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908006697] [2023-11-22 21:44:37,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:44:37,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:44:37,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:44:37,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:44:37,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:44:37,809 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-11-22 21:44:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:44:37,967 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2023-11-22 21:44:37,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 21:44:37,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 24 [2023-11-22 21:44:37,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:44:37,969 INFO L225 Difference]: With dead ends: 66 [2023-11-22 21:44:37,970 INFO L226 Difference]: Without dead ends: 64 [2023-11-22 21:44:37,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:44:37,971 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 32 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:44:37,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 94 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:44:37,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-22 21:44:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2023-11-22 21:44:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 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) [2023-11-22 21:44:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2023-11-22 21:44:37,991 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 24 [2023-11-22 21:44:37,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:44:37,992 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2023-11-22 21:44:37,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-11-22 21:44:37,992 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2023-11-22 21:44:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-22 21:44:37,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:44:37,993 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:44:37,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 21:44:37,994 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:44:37,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:44:37,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1489036997, now seen corresponding path program 1 times [2023-11-22 21:44:37,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:44:37,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306077580] [2023-11-22 21:44:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:44:37,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:44:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:44:38,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:44:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:44:38,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:44:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:44:38,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-22 21:44:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:44:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:44:38,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:44:38,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306077580] [2023-11-22 21:44:38,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306077580] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:44:38,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:44:38,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:44:38,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094037242] [2023-11-22 21:44:38,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:44:38,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:44:38,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:44:38,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:44:38,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:44:38,380 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-22 21:44:38,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:44:38,882 INFO L93 Difference]: Finished difference Result 172 states and 225 transitions. [2023-11-22 21:44:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 21:44:38,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 3 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 24 [2023-11-22 21:44:38,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:44:38,888 INFO L225 Difference]: With dead ends: 172 [2023-11-22 21:44:38,889 INFO L226 Difference]: Without dead ends: 121 [2023-11-22 21:44:38,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-22 21:44:38,897 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 119 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 21:44:38,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 103 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 21:44:38,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-22 21:44:38,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2023-11-22 21:44:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 74 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 13 states have return successors, (29), 18 states have call predecessors, (29), 18 states have call successors, (29) [2023-11-22 21:44:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2023-11-22 21:44:38,924 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 24 [2023-11-22 21:44:38,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:44:38,924 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2023-11-22 21:44:38,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-22 21:44:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2023-11-22 21:44:38,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-22 21:44:38,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:44:38,928 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:44:38,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 21:44:38,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:44:38,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:44:38,929 INFO L85 PathProgramCache]: Analyzing trace with hash -97933331, now seen corresponding path program 1 times [2023-11-22 21:44:38,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:44:38,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113945483] [2023-11-22 21:44:38,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:44:38,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:44:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 21:44:38,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 21:44:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 21:44:39,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 21:44:39,072 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 21:44:39,073 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-22 21:44:39,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-11-22 21:44:39,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-11-22 21:44:39,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 21:44:39,078 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-22 21:44:39,082 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 21:44:39,105 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret35 [2023-11-22 21:44:39,106 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret36 [2023-11-22 21:44:39,108 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret32 could not be translated [2023-11-22 21:44:39,109 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret17 could not be translated [2023-11-22 21:44:39,110 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret18 [2023-11-22 21:44:39,110 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem6 [2023-11-22 21:44:39,111 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem30 [2023-11-22 21:44:39,111 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret32 could not be translated [2023-11-22 21:44:39,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:44:39 BoogieIcfgContainer [2023-11-22 21:44:39,124 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 21:44:39,124 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 21:44:39,125 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 21:44:39,125 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 21:44:39,125 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:44:36" (3/4) ... [2023-11-22 21:44:39,126 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-22 21:44:39,136 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret35 [2023-11-22 21:44:39,136 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret36 [2023-11-22 21:44:39,137 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret32 could not be translated [2023-11-22 21:44:39,138 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret17 could not be translated [2023-11-22 21:44:39,138 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret18 [2023-11-22 21:44:39,139 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem6 [2023-11-22 21:44:39,140 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem30 [2023-11-22 21:44:39,140 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret32 could not be translated [2023-11-22 21:44:39,176 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 21:44:39,177 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 21:44:39,177 INFO L158 Benchmark]: Toolchain (without parser) took 3662.02ms. Allocated memory was 167.8MB in the beginning and 211.8MB in the end (delta: 44.0MB). Free memory was 133.9MB in the beginning and 164.2MB in the end (delta: -30.2MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2023-11-22 21:44:39,178 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:44:39,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.68ms. Allocated memory is still 167.8MB. Free memory was 133.9MB in the beginning and 113.1MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-22 21:44:39,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.72ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 110.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:44:39,179 INFO L158 Benchmark]: Boogie Preprocessor took 88.97ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 105.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-22 21:44:39,179 INFO L158 Benchmark]: RCFGBuilder took 625.77ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 118.9MB in the end (delta: -13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-22 21:44:39,179 INFO L158 Benchmark]: TraceAbstraction took 2264.24ms. Allocated memory was 167.8MB in the beginning and 211.8MB in the end (delta: 44.0MB). Free memory was 117.9MB in the beginning and 169.4MB in the end (delta: -51.5MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. [2023-11-22 21:44:39,180 INFO L158 Benchmark]: Witness Printer took 52.53ms. Allocated memory is still 211.8MB. Free memory was 169.4MB in the beginning and 164.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-22 21:44:39,181 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.17ms. Allocated memory is still 109.1MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 570.68ms. Allocated memory is still 167.8MB. Free memory was 133.9MB in the beginning and 113.1MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.72ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 110.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.97ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 105.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 625.77ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 118.9MB in the end (delta: -13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2264.24ms. Allocated memory was 167.8MB in the beginning and 211.8MB in the end (delta: 44.0MB). Free memory was 117.9MB in the beginning and 169.4MB in the end (delta: -51.5MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. * Witness Printer took 52.53ms. Allocated memory is still 211.8MB. Free memory was 169.4MB in the beginning and 164.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret35 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret36 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret18 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem30 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret32 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret35 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret36 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret18 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem30 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret32 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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) }; [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; [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 [\old(cond)=1, cond=1, mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; [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 [e={-1: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] { const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );} [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 [e={-1:0}, e={-1:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L660] return 0; VAL [\result=0, e={-1:0}, e={-1:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L669] RET ldv_is_in_set(m, &mutexes) VAL [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 [e={-1: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] { const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );} [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 [e={-1:0}, e={-1:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L660] return 0; VAL [\result=0, e={-1:0}, e={-1:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L636] RET, EXPR ldv_is_in_set(new, s) VAL [mutexes={3:0}, new={-1:0}, new={-1: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={-1:0}, new={-1: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; [L638] RET, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) VAL [mutexes={3:0}, new={-1:0}, new={-1:0}, s={3:0}, s={3:0}] [L638] EXPR le = (struct ldv_list_element*)ldv_successful_malloc(sizeof(struct ldv_list_element)) [L639] EXPR le->e = new [L640] CALL, EXPR ldv_list_add(&le->list, s) [L608] EXPR head->next VAL [m={-1:0}, m={-1:0}, mutexes={3:0}] [L608] CALL __ldv_list_add(new, head, head->next) VAL [mutexes={3:0}, new={-3:4}, next={3:0}, prev={3:0}] [L596] next->prev = new [L597] new->next = next [L598] new->prev = prev [L599] prev->next = new [L608] RET __ldv_list_add(new, head, head->next) VAL [head={3:0}, head={3:0}, mutexes={3:0}, new={-3:4}, new={-3:4}] [L640] RET, EXPR ldv_list_add(&le->list, s) [L636-L641] { struct ldv_list_element *le; le = (struct ldv_list_element*)ldv_successful_malloc(sizeof(struct ldv_list_element)); le->e = new; ldv_list_add(&le->list, s); } VAL [mutexes={3:0}, new={-1:0}, new={-1:0}, s={3:0}, s={3:0}] [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 [e={-1: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] { const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );} [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 [e={-1:0}, e={-1:0}, m={-3:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L656] COND TRUE m->e == e [L657] return 1; VAL [\result=1, e={-1:0}, e={-1:0}, m={-3:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L669] RET ldv_is_in_set(m, &mutexes) VAL [m={-1:0}, m={-1:0}, mutexes={3:0}] [L669] COND TRUE ldv_is_in_set(m, &mutexes) [L669] reach_error() VAL [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, 55 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 431 IncrementalHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 102 mSDtfsCounter, 431 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=3, 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, 3 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 281 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 12/12 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! [2023-11-22 21:44:39,212 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... --- 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