./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 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:28:26,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:28:27,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:28:27,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:28:27,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:28:27,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:28:27,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:28:27,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:28:27,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:28:27,046 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:28:27,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:28:27,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:28:27,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:28:27,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:28:27,049 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:28:27,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:28:27,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:28:27,053 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:28:27,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:28:27,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:28:27,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:28:27,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:28:27,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:28:27,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:28:27,057 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:28:27,057 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:28:27,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:28:27,058 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:28:27,058 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:28:27,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:28:27,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:28:27,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:28:27,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:28:27,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:28:27,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:28:27,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:28:27,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:28:27,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:28:27,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:28:27,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:28:27,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:28:27,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:28:27,064 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-11 19:28:27,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:28:27,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:28:27,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:28:27,410 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:28:27,411 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:28:27,412 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-11 19:28:28,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:28:29,157 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:28:29,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2024-11-11 19:28:29,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/710f65633/9425cbbe7dea4d7dacbfa19ebc371530/FLAG9b6eaccd4 [2024-11-11 19:28:29,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/710f65633/9425cbbe7dea4d7dacbfa19ebc371530 [2024-11-11 19:28:29,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:28:29,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:28:29,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:28:29,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:28:29,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:28:29,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:28:29" (1/1) ... [2024-11-11 19:28:29,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446c1292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:29, skipping insertion in model container [2024-11-11 19:28:29,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:28:29" (1/1) ... [2024-11-11 19:28:29,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:28:29,594 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-11 19:28:29,600 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-11 19:28:29,602 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-11 19:28:29,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:28:29,620 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:28:29,665 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-11 19:28:29,666 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-11 19:28:29,667 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-11 19:28:29,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:28:29,713 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:28:29,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:29 WrapperNode [2024-11-11 19:28:29,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:28:29,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:28:29,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:28:29,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:28:29,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:29" (1/1) ... [2024-11-11 19:28:29,743 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:29" (1/1) ... [2024-11-11 19:28:29,770 INFO L138 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 140 [2024-11-11 19:28:29,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:28:29,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:28:29,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:28:29,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:28:29,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:29" (1/1) ... [2024-11-11 19:28:29,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:29" (1/1) ... [2024-11-11 19:28:29,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:29" (1/1) ... [2024-11-11 19:28:29,823 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-11 19:28:29,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:29" (1/1) ... [2024-11-11 19:28:29,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:29" (1/1) ... [2024-11-11 19:28:29,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:29" (1/1) ... [2024-11-11 19:28:29,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:29" (1/1) ... [2024-11-11 19:28:29,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:29" (1/1) ... [2024-11-11 19:28:29,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:29" (1/1) ... [2024-11-11 19:28:29,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:28:29,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:28:29,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:28:29,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:28:29,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:29" (1/1) ... [2024-11-11 19:28:29,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:28:29,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:28:29,879 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-11 19:28:29,882 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-11 19:28:29,956 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-11 19:28:29,956 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-11 19:28:29,961 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2024-11-11 19:28:29,961 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2024-11-11 19:28:29,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-11 19:28:29,962 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2024-11-11 19:28:29,962 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2024-11-11 19:28:29,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:28:29,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-11 19:28:29,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-11 19:28:29,962 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-11-11 19:28:29,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-11-11 19:28:29,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-11 19:28:29,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-11 19:28:29,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 19:28:29,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-11 19:28:29,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-11 19:28:29,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:28:29,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 19:28:29,963 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-11-11 19:28:29,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-11-11 19:28:29,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:28:29,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:28:30,111 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:28:30,113 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:28:30,385 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-11 19:28:30,385 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:28:30,404 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:28:30,404 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 19:28:30,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:28:30 BoogieIcfgContainer [2024-11-11 19:28:30,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:28:30,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:28:30,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:28:30,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:28:30,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:28:29" (1/3) ... [2024-11-11 19:28:30,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac54fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:28:30, skipping insertion in model container [2024-11-11 19:28:30,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:29" (2/3) ... [2024-11-11 19:28:30,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac54fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:28:30, skipping insertion in model container [2024-11-11 19:28:30,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:28:30" (3/3) ... [2024-11-11 19:28:30,416 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_lock.i [2024-11-11 19:28:30,432 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:28:30,433 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-11 19:28:30,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:28:30,493 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;@5616cbfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:28:30,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-11 19:28:30,501 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-11 19:28:30,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 19:28:30,508 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:30,508 INFO L218 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-11 19:28:30,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:30,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:30,516 INFO L85 PathProgramCache]: Analyzing trace with hash 709034920, now seen corresponding path program 1 times [2024-11-11 19:28:30,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:30,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100117293] [2024-11-11 19:28:30,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:30,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:30,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 19:28:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:30,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 19:28:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:30,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 19:28:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:30,823 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-11 19:28:30,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:30,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100117293] [2024-11-11 19:28:30,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100117293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:28:30,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:28:30,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:28:30,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221888656] [2024-11-11 19:28:30,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:28:30,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:28:30,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:30,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:28:30,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:28:30,852 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 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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) [2024-11-11 19:28:31,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:31,001 INFO L93 Difference]: Finished difference Result 147 states and 193 transitions. [2024-11-11 19:28:31,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:28:31,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 28 [2024-11-11 19:28:31,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:31,012 INFO L225 Difference]: With dead ends: 147 [2024-11-11 19:28:31,013 INFO L226 Difference]: Without dead ends: 76 [2024-11-11 19:28:31,019 INFO L434 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 [2024-11-11 19:28:31,024 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:31,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 74 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:28:31,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-11 19:28:31,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2024-11-11 19:28:31,070 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-11 19:28:31,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2024-11-11 19:28:31,075 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 28 [2024-11-11 19:28:31,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:31,079 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2024-11-11 19:28:31,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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) [2024-11-11 19:28:31,079 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2024-11-11 19:28:31,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 19:28:31,081 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:31,081 INFO L218 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-11 19:28:31,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:28:31,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:31,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:31,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2117471768, now seen corresponding path program 1 times [2024-11-11 19:28:31,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:31,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009694055] [2024-11-11 19:28:31,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:31,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:31,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 19:28:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:31,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 19:28:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:31,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 19:28:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:31,328 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-11 19:28:31,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:31,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009694055] [2024-11-11 19:28:31,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009694055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:28:31,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:28:31,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:28:31,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897137627] [2024-11-11 19:28:31,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:28:31,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:28:31,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:31,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:28:31,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:28:31,333 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-11 19:28:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:31,542 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2024-11-11 19:28:31,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:28:31,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-11 19:28:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:31,546 INFO L225 Difference]: With dead ends: 82 [2024-11-11 19:28:31,546 INFO L226 Difference]: Without dead ends: 80 [2024-11-11 19:28:31,547 INFO L434 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 [2024-11-11 19:28:31,549 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 38 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:31,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 141 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:28:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-11 19:28:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2024-11-11 19:28:31,565 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-11 19:28:31,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2024-11-11 19:28:31,567 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 28 [2024-11-11 19:28:31,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:31,567 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2024-11-11 19:28:31,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-11 19:28:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2024-11-11 19:28:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 19:28:31,571 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:31,571 INFO L218 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-11 19:28:31,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:28:31,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:31,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:31,572 INFO L85 PathProgramCache]: Analyzing trace with hash -542868463, now seen corresponding path program 1 times [2024-11-11 19:28:31,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:31,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6482332] [2024-11-11 19:28:31,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:31,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:31,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 19:28:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:31,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 19:28:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:31,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 19:28:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:32,068 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-11 19:28:32,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:32,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6482332] [2024-11-11 19:28:32,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6482332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:28:32,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:28:32,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:28:32,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670750764] [2024-11-11 19:28:32,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:28:32,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:28:32,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:32,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:28:32,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:28:32,072 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-11-11 19:28:32,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:32,625 INFO L93 Difference]: Finished difference Result 206 states and 259 transitions. [2024-11-11 19:28:32,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 19:28:32,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 28 [2024-11-11 19:28:32,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:32,629 INFO L225 Difference]: With dead ends: 206 [2024-11-11 19:28:32,629 INFO L226 Difference]: Without dead ends: 145 [2024-11-11 19:28:32,630 INFO L434 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 [2024-11-11 19:28:32,631 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 132 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:32,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 164 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 19:28:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-11 19:28:32,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 120. [2024-11-11 19:28:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 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) [2024-11-11 19:28:32,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2024-11-11 19:28:32,664 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 28 [2024-11-11 19:28:32,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:32,665 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2024-11-11 19:28:32,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-11-11 19:28:32,665 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2024-11-11 19:28:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 19:28:32,667 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:32,667 INFO L218 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-11 19:28:32,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 19:28:32,667 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:32,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash 391053642, now seen corresponding path program 1 times [2024-11-11 19:28:32,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:32,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355378328] [2024-11-11 19:28:32,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:32,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:32,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 19:28:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:32,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 19:28:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:32,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 19:28:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:32,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 19:28:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:32,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 19:28:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:32,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 19:28:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:32,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 19:28:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:32,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 19:28:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:32,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 19:28:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:32,869 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-11 19:28:32,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:32,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355378328] [2024-11-11 19:28:32,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355378328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:28:32,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874332901] [2024-11-11 19:28:32,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:32,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:32,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:28:32,873 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-11 19:28:32,877 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-11 19:28:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:33,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 19:28:33,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:28:33,063 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-11 19:28:33,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:28:33,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874332901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:28:33,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:28:33,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-11-11 19:28:33,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965648708] [2024-11-11 19:28:33,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:28:33,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:28:33,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:33,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:28:33,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:28:33,067 INFO L87 Difference]: Start difference. First operand 120 states and 149 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-11 19:28:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:33,091 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2024-11-11 19:28:33,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:28:33,092 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-11 19:28:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:33,093 INFO L225 Difference]: With dead ends: 219 [2024-11-11 19:28:33,094 INFO L226 Difference]: Without dead ends: 126 [2024-11-11 19:28:33,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:28:33,098 INFO L435 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-11 19:28:33,099 INFO L436 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-11 19:28:33,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-11 19:28:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-11 19:28:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 96 states have internal predecessors, (107), 18 states have call successors, (18), 9 states have call predecessors, (18), 14 states have return successors, (30), 20 states have call predecessors, (30), 18 states have call successors, (30) [2024-11-11 19:28:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2024-11-11 19:28:33,122 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 72 [2024-11-11 19:28:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:33,123 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2024-11-11 19:28:33,123 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-11 19:28:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2024-11-11 19:28:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 19:28:33,125 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:33,125 INFO L218 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-11 19:28:33,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 19:28:33,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:33,326 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:33,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:33,327 INFO L85 PathProgramCache]: Analyzing trace with hash 336841398, now seen corresponding path program 1 times [2024-11-11 19:28:33,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:33,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455274639] [2024-11-11 19:28:33,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 19:28:33,387 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 19:28:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 19:28:33,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 19:28:33,449 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 19:28:33,450 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-11 19:28:33,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-11 19:28:33,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-11-11 19:28:33,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 19:28:33,458 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-11 19:28:33,519 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 19:28:33,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 07:28:33 BoogieIcfgContainer [2024-11-11 19:28:33,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 19:28:33,522 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 19:28:33,525 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 19:28:33,526 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 19:28:33,526 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:28:30" (3/4) ... [2024-11-11 19:28:33,527 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 19:28:33,593 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 19:28:33,593 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 19:28:33,594 INFO L158 Benchmark]: Toolchain (without parser) took 4391.70ms. Allocated memory is still 176.2MB. Free memory was 129.1MB in the beginning and 68.9MB in the end (delta: 60.2MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2024-11-11 19:28:33,594 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 19:28:33,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.08ms. Allocated memory is still 176.2MB. Free memory was 129.1MB in the beginning and 106.8MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-11 19:28:33,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.95ms. Allocated memory is still 176.2MB. Free memory was 106.8MB in the beginning and 104.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 19:28:33,595 INFO L158 Benchmark]: Boogie Preprocessor took 76.87ms. Allocated memory is still 176.2MB. Free memory was 104.3MB in the beginning and 99.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 19:28:33,595 INFO L158 Benchmark]: RCFGBuilder took 556.03ms. Allocated memory is still 176.2MB. Free memory was 99.5MB in the beginning and 126.5MB in the end (delta: -27.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 19:28:33,595 INFO L158 Benchmark]: TraceAbstraction took 3114.33ms. Allocated memory is still 176.2MB. Free memory was 126.5MB in the beginning and 73.1MB in the end (delta: 53.4MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2024-11-11 19:28:33,595 INFO L158 Benchmark]: Witness Printer took 70.75ms. Allocated memory is still 176.2MB. Free memory was 73.1MB in the beginning and 68.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 19:28:33,597 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.18ms. Allocated memory is still 100.7MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.08ms. Allocated memory is still 176.2MB. Free memory was 129.1MB in the beginning and 106.8MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.95ms. Allocated memory is still 176.2MB. Free memory was 106.8MB in the beginning and 104.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.87ms. Allocated memory is still 176.2MB. Free memory was 104.3MB in the beginning and 99.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 556.03ms. Allocated memory is still 176.2MB. Free memory was 99.5MB in the beginning and 126.5MB in the end (delta: -27.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3114.33ms. Allocated memory is still 176.2MB. Free memory was 126.5MB in the beginning and 73.1MB in the end (delta: 53.4MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * Witness Printer took 70.75ms. Allocated memory is still 176.2MB. Free memory was 73.1MB in the beginning and 68.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 3.0s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 217 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 593 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 376 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 445 IncrementalHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 217 mSDtfsCounter, 445 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=4, InterpolantAutomatonStates: 23, 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, 47 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 375 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 136/147 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-11 19:28:33,629 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