./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_35-trylock_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/04-mutex_35-trylock_rc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc4ff81e27c3c9c08a24375d30c2902a85848d2bd345364dfe2b3c3839c5dc11 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:30:41,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:30:41,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:30:41,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:30:41,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:30:41,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:30:41,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:30:41,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:30:41,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:30:41,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:30:41,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:30:41,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:30:41,831 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:30:41,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:30:41,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:30:41,831 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:30:41,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:30:41,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:30:41,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:30:41,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:30:41,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:30:41,832 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:30:41,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:30:41,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:30:41,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:30:41,833 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 ! data-race) ) 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 -> bc4ff81e27c3c9c08a24375d30c2902a85848d2bd345364dfe2b3c3839c5dc11 [2025-02-08 05:30:42,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:30:42,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:30:42,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:30:42,200 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:30:42,200 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:30:42,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_35-trylock_rc.i [2025-02-08 05:30:43,365 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e5e332b8e/e3b452c4949e4ea08332870e870e414f/FLAG867af5dd1 [2025-02-08 05:30:43,709 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:30:43,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_35-trylock_rc.i [2025-02-08 05:30:43,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e5e332b8e/e3b452c4949e4ea08332870e870e414f/FLAG867af5dd1 [2025-02-08 05:30:43,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e5e332b8e/e3b452c4949e4ea08332870e870e414f [2025-02-08 05:30:43,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:30:43,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:30:43,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:30:43,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:30:43,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:30:43,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:30:43" (1/1) ... [2025-02-08 05:30:43,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b8ace5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:43, skipping insertion in model container [2025-02-08 05:30:43,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:30:43" (1/1) ... [2025-02-08 05:30:43,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:30:44,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:30:44,177 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:30:44,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:30:44,337 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:30:44,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:44 WrapperNode [2025-02-08 05:30:44,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:30:44,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:30:44,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:30:44,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:30:44,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:44" (1/1) ... [2025-02-08 05:30:44,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:44" (1/1) ... [2025-02-08 05:30:44,388 INFO L138 Inliner]: procedures = 525, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 113 [2025-02-08 05:30:44,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:30:44,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:30:44,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:30:44,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:30:44,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:44" (1/1) ... [2025-02-08 05:30:44,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:44" (1/1) ... [2025-02-08 05:30:44,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:44" (1/1) ... [2025-02-08 05:30:44,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:44" (1/1) ... [2025-02-08 05:30:44,413 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:44" (1/1) ... [2025-02-08 05:30:44,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:44" (1/1) ... [2025-02-08 05:30:44,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:44" (1/1) ... [2025-02-08 05:30:44,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:44" (1/1) ... [2025-02-08 05:30:44,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:30:44,424 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:30:44,424 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:30:44,424 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:30:44,425 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:44" (1/1) ... [2025-02-08 05:30:44,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:30:44,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:30:44,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:30:44,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:30:44,477 INFO L130 BoogieDeclarations]: Found specification of procedure counter_thread [2025-02-08 05:30:44,477 INFO L138 BoogieDeclarations]: Found implementation of procedure counter_thread [2025-02-08 05:30:44,477 INFO L130 BoogieDeclarations]: Found specification of procedure monitor_thread [2025-02-08 05:30:44,477 INFO L138 BoogieDeclarations]: Found implementation of procedure monitor_thread [2025-02-08 05:30:44,477 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:30:44,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:30:44,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:30:44,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:30:44,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:30:44,477 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2025-02-08 05:30:44,477 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:30:44,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:30:44,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:30:44,478 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:30:44,681 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:30:44,682 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:30:44,932 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:30:44,933 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:30:44,946 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:30:44,947 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:30:44,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:30:44 BoogieIcfgContainer [2025-02-08 05:30:44,947 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:30:44,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:30:44,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:30:44,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:30:44,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:30:43" (1/3) ... [2025-02-08 05:30:44,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb26c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:30:44, skipping insertion in model container [2025-02-08 05:30:44,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:44" (2/3) ... [2025-02-08 05:30:44,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb26c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:30:44, skipping insertion in model container [2025-02-08 05:30:44,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:30:44" (3/3) ... [2025-02-08 05:30:44,956 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_35-trylock_rc.i [2025-02-08 05:30:44,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:30:44,968 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_35-trylock_rc.i that has 3 procedures, 236 locations, 1 initial locations, 11 loop locations, and 16 error locations. [2025-02-08 05:30:44,969 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:30:45,044 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:30:45,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 273 transitions, 560 flow [2025-02-08 05:30:45,122 INFO L124 PetriNetUnfolderBase]: 38/271 cut-off events. [2025-02-08 05:30:45,124 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:30:45,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 271 events. 38/271 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 894 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 197. Up to 5 conditions per place. [2025-02-08 05:30:45,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 273 transitions, 560 flow [2025-02-08 05:30:45,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 234 places, 263 transitions, 538 flow [2025-02-08 05:30:45,140 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:30:45,150 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;@6ede2e0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:30:45,150 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-02-08 05:30:45,159 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:30:45,162 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-08 05:30:45,163 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:30:45,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:45,163 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:45,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [monitor_threadErr5ASSERT_VIOLATIONDATA_RACE, monitor_threadErr4ASSERT_VIOLATIONDATA_RACE, monitor_threadErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:30:45,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:45,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2024222921, now seen corresponding path program 1 times [2025-02-08 05:30:45,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:45,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126113575] [2025-02-08 05:30:45,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:45,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:45,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:30:45,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:30:45,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:45,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:45,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:45,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126113575] [2025-02-08 05:30:45,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126113575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:45,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:45,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:45,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561134747] [2025-02-08 05:30:45,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:45,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:45,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:45,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:45,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:45,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 273 [2025-02-08 05:30:45,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 263 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:45,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:45,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 273 [2025-02-08 05:30:45,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:45,678 INFO L124 PetriNetUnfolderBase]: 46/541 cut-off events. [2025-02-08 05:30:45,678 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-08 05:30:45,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 541 events. 46/541 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2980 event pairs, 15 based on Foata normal form. 93/545 useless extension candidates. Maximal degree in co-relation 472. Up to 48 conditions per place. [2025-02-08 05:30:45,684 INFO L140 encePairwiseOnDemand]: 253/273 looper letters, 13 selfloop transitions, 2 changer transitions 9/230 dead transitions. [2025-02-08 05:30:45,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 230 transitions, 502 flow [2025-02-08 05:30:45,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2025-02-08 05:30:45,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8827838827838828 [2025-02-08 05:30:45,698 INFO L175 Difference]: Start difference. First operand has 234 places, 263 transitions, 538 flow. Second operand 3 states and 723 transitions. [2025-02-08 05:30:45,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 230 transitions, 502 flow [2025-02-08 05:30:45,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 230 transitions, 494 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:30:45,705 INFO L231 Difference]: Finished difference. Result has 223 places, 221 transitions, 450 flow [2025-02-08 05:30:45,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=223, PETRI_TRANSITIONS=221} [2025-02-08 05:30:45,710 INFO L279 CegarLoopForPetriNet]: 234 programPoint places, -11 predicate places. [2025-02-08 05:30:45,710 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 221 transitions, 450 flow [2025-02-08 05:30:45,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:45,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:45,710 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1] [2025-02-08 05:30:45,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:30:45,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [monitor_threadErr5ASSERT_VIOLATIONDATA_RACE, monitor_threadErr4ASSERT_VIOLATIONDATA_RACE, monitor_threadErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:30:45,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:45,711 INFO L85 PathProgramCache]: Analyzing trace with hash -406309850, now seen corresponding path program 1 times [2025-02-08 05:30:45,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:45,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272885258] [2025-02-08 05:30:45,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:45,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:45,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:30:45,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:30:45,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:45,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:45,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:45,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272885258] [2025-02-08 05:30:45,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272885258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:45,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:45,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:45,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304393505] [2025-02-08 05:30:45,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:45,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:45,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:45,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:45,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:45,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 273 [2025-02-08 05:30:45,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 221 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:45,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:45,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 273 [2025-02-08 05:30:45,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:45,961 INFO L124 PetriNetUnfolderBase]: 355/1527 cut-off events. [2025-02-08 05:30:45,962 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:30:45,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1971 conditions, 1527 events. 355/1527 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 11830 event pairs, 96 based on Foata normal form. 1/1367 useless extension candidates. Maximal degree in co-relation 1940. Up to 407 conditions per place. [2025-02-08 05:30:45,973 INFO L140 encePairwiseOnDemand]: 257/273 looper letters, 27 selfloop transitions, 7 changer transitions 5/226 dead transitions. [2025-02-08 05:30:45,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 226 transitions, 534 flow [2025-02-08 05:30:45,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2025-02-08 05:30:45,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8412698412698413 [2025-02-08 05:30:45,976 INFO L175 Difference]: Start difference. First operand has 223 places, 221 transitions, 450 flow. Second operand 3 states and 689 transitions. [2025-02-08 05:30:45,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 226 transitions, 534 flow [2025-02-08 05:30:45,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 226 transitions, 530 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:30:45,979 INFO L231 Difference]: Finished difference. Result has 208 places, 215 transitions, 468 flow [2025-02-08 05:30:45,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=208, PETRI_TRANSITIONS=215} [2025-02-08 05:30:45,980 INFO L279 CegarLoopForPetriNet]: 234 programPoint places, -26 predicate places. [2025-02-08 05:30:45,980 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 215 transitions, 468 flow [2025-02-08 05:30:45,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:45,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:45,981 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1] [2025-02-08 05:30:45,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:30:45,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting counter_threadErr4ASSERT_VIOLATIONDATA_RACE === [monitor_threadErr5ASSERT_VIOLATIONDATA_RACE, monitor_threadErr4ASSERT_VIOLATIONDATA_RACE, monitor_threadErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:30:45,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:45,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1956795617, now seen corresponding path program 1 times [2025-02-08 05:30:45,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:45,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683670379] [2025-02-08 05:30:45,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:45,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:45,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:30:46,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:30:46,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:46,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:46,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:46,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683670379] [2025-02-08 05:30:46,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683670379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:46,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:46,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:46,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228594279] [2025-02-08 05:30:46,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:46,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:46,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:46,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:46,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:46,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 273 [2025-02-08 05:30:46,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 215 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:46,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:46,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 273 [2025-02-08 05:30:46,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:46,286 INFO L124 PetriNetUnfolderBase]: 124/985 cut-off events. [2025-02-08 05:30:46,290 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:30:46,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 985 events. 124/985 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6826 event pairs, 23 based on Foata normal form. 0/858 useless extension candidates. Maximal degree in co-relation 542. Up to 79 conditions per place. [2025-02-08 05:30:46,302 INFO L140 encePairwiseOnDemand]: 269/273 looper letters, 13 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2025-02-08 05:30:46,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 216 transitions, 501 flow [2025-02-08 05:30:46,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-02-08 05:30:46,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8705738705738706 [2025-02-08 05:30:46,311 INFO L175 Difference]: Start difference. First operand has 208 places, 215 transitions, 468 flow. Second operand 3 states and 713 transitions. [2025-02-08 05:30:46,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 216 transitions, 501 flow [2025-02-08 05:30:46,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 216 transitions, 501 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:30:46,319 INFO L231 Difference]: Finished difference. Result has 204 places, 215 transitions, 478 flow [2025-02-08 05:30:46,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=204, PETRI_TRANSITIONS=215} [2025-02-08 05:30:46,321 INFO L279 CegarLoopForPetriNet]: 234 programPoint places, -30 predicate places. [2025-02-08 05:30:46,321 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 215 transitions, 478 flow [2025-02-08 05:30:46,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:46,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:46,322 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:46,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:30:46,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting counter_threadErr2ASSERT_VIOLATIONDATA_RACE === [monitor_threadErr5ASSERT_VIOLATIONDATA_RACE, monitor_threadErr4ASSERT_VIOLATIONDATA_RACE, monitor_threadErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:30:46,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:46,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1304796490, now seen corresponding path program 1 times [2025-02-08 05:30:46,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:46,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714779608] [2025-02-08 05:30:46,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:46,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:46,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:30:46,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:30:46,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:46,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:46,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:46,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714779608] [2025-02-08 05:30:46,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714779608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:46,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:46,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:46,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653628229] [2025-02-08 05:30:46,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:46,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:46,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:46,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:46,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:46,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 273 [2025-02-08 05:30:46,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 215 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:46,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:46,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 273 [2025-02-08 05:30:46,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:46,693 INFO L124 PetriNetUnfolderBase]: 285/2048 cut-off events. [2025-02-08 05:30:46,694 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:30:46,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2526 conditions, 2048 events. 285/2048 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 16586 event pairs, 31 based on Foata normal form. 0/1799 useless extension candidates. Maximal degree in co-relation 2325. Up to 166 conditions per place. [2025-02-08 05:30:46,713 INFO L140 encePairwiseOnDemand]: 262/273 looper letters, 24 selfloop transitions, 8 changer transitions 0/229 dead transitions. [2025-02-08 05:30:46,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 229 transitions, 572 flow [2025-02-08 05:30:46,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:46,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2025-02-08 05:30:46,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8778998778998779 [2025-02-08 05:30:46,715 INFO L175 Difference]: Start difference. First operand has 204 places, 215 transitions, 478 flow. Second operand 3 states and 719 transitions. [2025-02-08 05:30:46,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 229 transitions, 572 flow [2025-02-08 05:30:46,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 229 transitions, 572 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:30:46,721 INFO L231 Difference]: Finished difference. Result has 208 places, 223 transitions, 548 flow [2025-02-08 05:30:46,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=208, PETRI_TRANSITIONS=223} [2025-02-08 05:30:46,722 INFO L279 CegarLoopForPetriNet]: 234 programPoint places, -26 predicate places. [2025-02-08 05:30:46,723 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 223 transitions, 548 flow [2025-02-08 05:30:46,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:46,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:46,724 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:46,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:30:46,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting counter_threadErr1ASSERT_VIOLATIONDATA_RACE === [monitor_threadErr5ASSERT_VIOLATIONDATA_RACE, monitor_threadErr4ASSERT_VIOLATIONDATA_RACE, monitor_threadErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:30:46,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:46,725 INFO L85 PathProgramCache]: Analyzing trace with hash 284362816, now seen corresponding path program 1 times [2025-02-08 05:30:46,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:46,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335434640] [2025-02-08 05:30:46,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:46,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:46,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:30:46,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:30:46,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:46,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:46,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:46,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335434640] [2025-02-08 05:30:46,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335434640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:46,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:46,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:46,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354154910] [2025-02-08 05:30:46,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:46,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:46,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:46,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:46,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:46,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 273 [2025-02-08 05:30:46,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 223 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:46,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:46,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 273 [2025-02-08 05:30:46,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:47,075 INFO L124 PetriNetUnfolderBase]: 488/3334 cut-off events. [2025-02-08 05:30:47,076 INFO L125 PetriNetUnfolderBase]: For 302/318 co-relation queries the response was YES. [2025-02-08 05:30:47,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4349 conditions, 3334 events. 488/3334 cut-off events. For 302/318 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 30765 event pairs, 57 based on Foata normal form. 7/2934 useless extension candidates. Maximal degree in co-relation 4138. Up to 287 conditions per place. [2025-02-08 05:30:47,100 INFO L140 encePairwiseOnDemand]: 266/273 looper letters, 23 selfloop transitions, 11 changer transitions 0/237 dead transitions. [2025-02-08 05:30:47,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 237 transitions, 668 flow [2025-02-08 05:30:47,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2025-02-08 05:30:47,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8791208791208791 [2025-02-08 05:30:47,103 INFO L175 Difference]: Start difference. First operand has 208 places, 223 transitions, 548 flow. Second operand 3 states and 720 transitions. [2025-02-08 05:30:47,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 237 transitions, 668 flow [2025-02-08 05:30:47,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 237 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:30:47,107 INFO L231 Difference]: Finished difference. Result has 210 places, 231 transitions, 624 flow [2025-02-08 05:30:47,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=210, PETRI_TRANSITIONS=231} [2025-02-08 05:30:47,108 INFO L279 CegarLoopForPetriNet]: 234 programPoint places, -24 predicate places. [2025-02-08 05:30:47,110 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 231 transitions, 624 flow [2025-02-08 05:30:47,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:47,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:47,110 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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] [2025-02-08 05:30:47,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:30:47,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting monitor_threadErr3ASSERT_VIOLATIONDATA_RACE === [monitor_threadErr5ASSERT_VIOLATIONDATA_RACE, monitor_threadErr4ASSERT_VIOLATIONDATA_RACE, monitor_threadErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:30:47,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:47,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1082280399, now seen corresponding path program 1 times [2025-02-08 05:30:47,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:47,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790341991] [2025-02-08 05:30:47,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:47,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:47,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 05:30:47,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 05:30:47,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:47,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:47,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:47,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790341991] [2025-02-08 05:30:47,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790341991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:47,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:47,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:47,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014221686] [2025-02-08 05:30:47,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:47,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:47,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:47,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:47,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:47,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 273 [2025-02-08 05:30:47,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 231 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:47,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:47,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 273 [2025-02-08 05:30:47,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:47,510 INFO L124 PetriNetUnfolderBase]: 615/4073 cut-off events. [2025-02-08 05:30:47,510 INFO L125 PetriNetUnfolderBase]: For 825/845 co-relation queries the response was YES. [2025-02-08 05:30:47,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5540 conditions, 4073 events. 615/4073 cut-off events. For 825/845 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 39401 event pairs, 78 based on Foata normal form. 3/3567 useless extension candidates. Maximal degree in co-relation 5270. Up to 348 conditions per place. [2025-02-08 05:30:47,543 INFO L140 encePairwiseOnDemand]: 266/273 looper letters, 27 selfloop transitions, 14 changer transitions 0/245 dead transitions. [2025-02-08 05:30:47,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 245 transitions, 779 flow [2025-02-08 05:30:47,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:47,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:47,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-02-08 05:30:47,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766788766788767 [2025-02-08 05:30:47,546 INFO L175 Difference]: Start difference. First operand has 210 places, 231 transitions, 624 flow. Second operand 3 states and 718 transitions. [2025-02-08 05:30:47,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 245 transitions, 779 flow [2025-02-08 05:30:47,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 245 transitions, 749 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:30:47,552 INFO L231 Difference]: Finished difference. Result has 212 places, 241 transitions, 736 flow [2025-02-08 05:30:47,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=212, PETRI_TRANSITIONS=241} [2025-02-08 05:30:47,555 INFO L279 CegarLoopForPetriNet]: 234 programPoint places, -22 predicate places. [2025-02-08 05:30:47,555 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 241 transitions, 736 flow [2025-02-08 05:30:47,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:47,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:47,556 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:47,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:30:47,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting monitor_threadErr4ASSERT_VIOLATIONDATA_RACE === [monitor_threadErr5ASSERT_VIOLATIONDATA_RACE, monitor_threadErr4ASSERT_VIOLATIONDATA_RACE, monitor_threadErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:30:47,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:47,557 INFO L85 PathProgramCache]: Analyzing trace with hash -419984389, now seen corresponding path program 1 times [2025-02-08 05:30:47,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:47,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725712447] [2025-02-08 05:30:47,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:47,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:47,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 05:30:47,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 05:30:47,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:47,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:30:47,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:30:47,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 05:30:47,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 05:30:47,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:47,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:30:47,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:30:47,633 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:30:47,634 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location monitor_threadErr4ASSERT_VIOLATIONDATA_RACE (28 of 29 remaining) [2025-02-08 05:30:47,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr5ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-02-08 05:30:47,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr4ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-02-08 05:30:47,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-02-08 05:30:47,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr1ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-02-08 05:30:47,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr3ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-02-08 05:30:47,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr0ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-02-08 05:30:47,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr4ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-02-08 05:30:47,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr3ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-02-08 05:30:47,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr2ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-02-08 05:30:47,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr1ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-02-08 05:30:47,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr0ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-02-08 05:30:47,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-02-08 05:30:47,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-02-08 05:30:47,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-02-08 05:30:47,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2025-02-08 05:30:47,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2025-02-08 05:30:47,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 29 remaining) [2025-02-08 05:30:47,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 29 remaining) [2025-02-08 05:30:47,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr5ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-02-08 05:30:47,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr2ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-02-08 05:30:47,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-02-08 05:30:47,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-02-08 05:30:47,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-02-08 05:30:47,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-02-08 05:30:47,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-02-08 05:30:47,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-02-08 05:30:47,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-02-08 05:30:47,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-02-08 05:30:47,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:30:47,637 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:47,721 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:30:47,724 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:30:47,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:30:47 BasicIcfg [2025-02-08 05:30:47,732 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:30:47,733 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:30:47,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:30:47,733 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:30:47,734 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:30:44" (3/4) ... [2025-02-08 05:30:47,735 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:30:47,826 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-02-08 05:30:47,891 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:30:47,891 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:30:47,891 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:30:47,892 INFO L158 Benchmark]: Toolchain (without parser) took 4149.60ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 105.1MB in the beginning and 242.2MB in the end (delta: -137.0MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2025-02-08 05:30:47,892 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:30:47,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.94ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 45.2MB in the end (delta: 59.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-08 05:30:47,896 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.25ms. Allocated memory is still 142.6MB. Free memory was 45.2MB in the beginning and 41.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:30:47,896 INFO L158 Benchmark]: Boogie Preprocessor took 30.31ms. Allocated memory is still 142.6MB. Free memory was 41.9MB in the beginning and 40.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:30:47,896 INFO L158 Benchmark]: IcfgBuilder took 523.42ms. Allocated memory is still 142.6MB. Free memory was 39.3MB in the beginning and 78.8MB in the end (delta: -39.5MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2025-02-08 05:30:47,896 INFO L158 Benchmark]: TraceAbstraction took 2784.03ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 78.1MB in the beginning and 259.2MB in the end (delta: -181.0MB). Peak memory consumption was 144.8MB. Max. memory is 16.1GB. [2025-02-08 05:30:47,896 INFO L158 Benchmark]: Witness Printer took 158.11ms. Allocated memory is still 310.4MB. Free memory was 259.2MB in the beginning and 242.2MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:30:47,897 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.24ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 595.94ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 45.2MB in the end (delta: 59.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.25ms. Allocated memory is still 142.6MB. Free memory was 45.2MB in the beginning and 41.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.31ms. Allocated memory is still 142.6MB. Free memory was 41.9MB in the beginning and 40.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 523.42ms. Allocated memory is still 142.6MB. Free memory was 39.3MB in the beginning and 78.8MB in the end (delta: -39.5MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2784.03ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 78.1MB in the beginning and 259.2MB in the end (delta: -181.0MB). Peak memory consumption was 144.8MB. Max. memory is 16.1GB. * Witness Printer took 158.11ms. Allocated memory is still 310.4MB. Free memory was 259.2MB in the beginning and 242.2MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1830]: Data race detected Data race detected The following path leads to a data race: [L1797] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mutex={1:0}] [L1798] 0 long counter; VAL [counter=0, mutex={1:0}] [L1799] 0 time_t end_time; VAL [counter=0, end_time=0, mutex={1:0}] [L1836] 0 int status; VAL [\old(argc)=1150, \old(argv)={1153:1151}, argc=1150, counter=0, end_time=0, mutex={1:0}] [L1837] 0 pthread_t counter_thread_id; VAL [\old(argc)=1150, \old(argv)={1153:1151}, argc=1150, counter=0, end_time=0, mutex={1:0}] [L1838] 0 pthread_t monitor_thread_id; VAL [\old(argc)=1150, \old(argv)={1153:1151}, argc=1150, counter=0, end_time=0, mutex={1:0}] [L1839] 0 end_time = time (((void *)0)) + 60 VAL [\old(argc)=1150, \old(argv)={1153:1151}, argc=1150, counter=0, end_time=60, mutex={1:0}] [L1840] EXPR, FCALL, FORK 0 pthread_create (&counter_thread_id, ((void *)0), counter_thread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=1150, \old(argv)={1153:1151}, argc=1150, counter=0, counter_thread_id=-1, end_time=60, mutex={1:0}] [L1801] 1 int status; VAL [\old(arg)={0:0}, arg={0:0}, counter=0, end_time=60, mutex={1:0}] [L1802] 1 int spin; VAL [\old(arg)={0:0}, arg={0:0}, counter=0, end_time=60, mutex={1:0}] [L1803] COND TRUE 1 time (((void *)0)) < end_time [L1803] 1 time (((void *)0)) < end_time VAL [\old(arg)={0:0}, arg={0:0}, counter=0, end_time=60, mutex={1:0}] [L1803] COND TRUE 1 time (((void *)0)) < end_time VAL [\old(arg)={0:0}, arg={0:0}, counter=0, end_time=60, mutex={1:0}] [L1804] 1 status = pthread_mutex_lock (&mutex) VAL [\old(arg)={0:0}, arg={0:0}, counter=0, end_time=60, mutex={1:0}, status=0] [L1805] COND FALSE 1 !(status != 0) VAL [\old(arg)={0:0}, arg={0:0}, counter=0, end_time=60, mutex={1:0}, status=0] [L1807] 1 spin = 0 VAL [\old(arg)={0:0}, arg={0:0}, counter=0, end_time=60, mutex={1:0}, spin=0, status=0] [L1807] COND TRUE 1 spin < 10000000 VAL [\old(arg)={0:0}, arg={0:0}, counter=0, end_time=60, mutex={1:0}, spin=0, status=0] [L1808] 1 counter++ VAL [\old(arg)={0:0}, arg={0:0}, counter=0, end_time=60, mutex={1:0}, spin=0, status=0] [L1840] 0 status = pthread_create (&counter_thread_id, ((void *)0), counter_thread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=1150, \old(argv)={1153:1151}, arg={0:0}, argc=1150, counter=0, counter_thread_id=-1, end_time=60, mutex={1:0}, spin=0, status=0, status=0] [L1841] COND FALSE 0 !(status != 0) VAL [\old(arg)={0:0}, \old(argc)=1150, \old(argv)={1153:1151}, arg={0:0}, argc=1150, counter=0, counter_thread_id=-1, end_time=60, mutex={1:0}, spin=0, status=0, status=0] [L1843] FCALL, FORK 0 pthread_create (&monitor_thread_id, ((void *)0), monitor_thread, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=1150, \old(argv)={1153:1151}, arg={0:0}, argc=1150, counter=0, counter_thread_id=-1, end_time=60, monitor_thread_id=0, mutex={1:0}, spin=0, status=0, status=0] [L1817] 2 int status; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, counter=0, end_time=60, mutex={1:0}, spin=0, status=0] [L1818] 2 int misses = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, counter=0, end_time=60, misses=0, mutex={1:0}, spin=0, status=0] [L1819] COND TRUE 2 time (((void *)0)) < end_time [L1819] 2 time (((void *)0)) < end_time VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, counter=0, end_time=60, misses=0, mutex={1:0}, spin=0, status=0] [L1819] COND TRUE 2 time (((void *)0)) < end_time VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, counter=0, end_time=60, misses=0, mutex={1:0}, spin=0, status=0] [L1821] 2 status = pthread_mutex_trylock (&mutex) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, counter=0, end_time=60, misses=0, mutex={1:0}, spin=0, status=0, status=16] [L1822] COND FALSE 2 !(status != 16) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, counter=0, end_time=60, misses=0, mutex={1:0}, spin=0, status=0, status=16] [L1830] 2 counter++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, counter=0, end_time=60, misses=0, mutex={1:0}, spin=0, status=0, status=16] [L1808] 1 counter++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, counter=1, end_time=60, misses=0, mutex={1:0}, spin=0, status=0, status=16] [L1830] 2 counter++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, counter=1, end_time=60, misses=0, mutex={1:0}, spin=0, status=0, status=16] Now there is a data race on ~counter~0 between C: counter++ [1808] and C: counter++ [1830] - UnprovableResult [Line: 1819]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1824]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1830]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1803]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1806]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1808]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1808]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1811]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1839]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1842]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1845]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1851]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1840]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1843]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 367 locations, 29 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 208 IncrementalHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 37 mSDtfsCounter, 208 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=736occurred in iteration=6, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 05:30:47,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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(DATA-RACE)