./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 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/goblint-regression/04-mutex_35-trylock_rc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-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 ! 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-?-735b3cc-m [2025-03-14 01:35:01,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:35:01,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:35:01,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:35:01,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:35:01,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:35:01,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:35:01,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:35:01,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:35:01,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:35:01,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:35:01,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:35:01,795 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:35:01,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:35:01,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:35:01,796 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:35:01,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:35:01,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:35:01,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:35:01,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:35:01,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:35:01,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:35:01,797 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:35:01,797 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:35:01,797 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:35:01,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:35:01,797 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:35:01,797 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:35:01,797 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:35:01,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:35:01,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:35:01,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:35:01,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:35:01,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:35:01,798 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:35:01,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:35:01,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:35:01,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:35:01,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:35:01,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:35:01,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:35:01,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:35:01,798 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/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-03-14 01:35:02,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:35:02,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:35:02,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:35:02,042 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:35:02,042 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:35:02,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_35-trylock_rc.i [2025-03-14 01:35:03,238 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe73f35fc/ba2a4b1b03944264a6efd5732d2f8e6b/FLAGe032cd41d [2025-03-14 01:35:03,505 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:35:03,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_35-trylock_rc.i [2025-03-14 01:35:03,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe73f35fc/ba2a4b1b03944264a6efd5732d2f8e6b/FLAGe032cd41d [2025-03-14 01:35:03,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe73f35fc/ba2a4b1b03944264a6efd5732d2f8e6b [2025-03-14 01:35:03,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:35:03,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:35:03,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:35:03,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:35:03,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:35:03,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:35:03" (1/1) ... [2025-03-14 01:35:03,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4ad49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:03, skipping insertion in model container [2025-03-14 01:35:03,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:35:03" (1/1) ... [2025-03-14 01:35:03,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:35:04,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:35:04,337 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:35:04,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:35:04,467 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:35:04,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:04 WrapperNode [2025-03-14 01:35:04,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:35:04,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:35:04,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:35:04,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:35:04,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:04" (1/1) ... [2025-03-14 01:35:04,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:04" (1/1) ... [2025-03-14 01:35:04,516 INFO L138 Inliner]: procedures = 525, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 113 [2025-03-14 01:35:04,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:35:04,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:35:04,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:35:04,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:35:04,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:04" (1/1) ... [2025-03-14 01:35:04,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:04" (1/1) ... [2025-03-14 01:35:04,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:04" (1/1) ... [2025-03-14 01:35:04,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:04" (1/1) ... [2025-03-14 01:35:04,540 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:04" (1/1) ... [2025-03-14 01:35:04,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:04" (1/1) ... [2025-03-14 01:35:04,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:04" (1/1) ... [2025-03-14 01:35:04,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:04" (1/1) ... [2025-03-14 01:35:04,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:35:04,555 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:35:04,556 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:35:04,556 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:35:04,556 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:04" (1/1) ... [2025-03-14 01:35:04,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:35:04,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:04,582 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) [2025-03-14 01:35:04,585 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 [2025-03-14 01:35:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure counter_thread [2025-03-14 01:35:04,603 INFO L138 BoogieDeclarations]: Found implementation of procedure counter_thread [2025-03-14 01:35:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure monitor_thread [2025-03-14 01:35:04,603 INFO L138 BoogieDeclarations]: Found implementation of procedure monitor_thread [2025-03-14 01:35:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:35:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:35:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:35:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:35:04,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:35:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2025-03-14 01:35:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:35:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:35:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:35:04,604 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:35:04,803 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:35:04,804 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:35:05,061 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:35:05,062 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:35:05,062 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:35:05,082 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:35:05,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:05 BoogieIcfgContainer [2025-03-14 01:35:05,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:35:05,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:35:05,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:35:05,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:35:05,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:35:03" (1/3) ... [2025-03-14 01:35:05,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab2bf09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:35:05, skipping insertion in model container [2025-03-14 01:35:05,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:04" (2/3) ... [2025-03-14 01:35:05,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab2bf09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:35:05, skipping insertion in model container [2025-03-14 01:35:05,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:05" (3/3) ... [2025-03-14 01:35:05,089 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_35-trylock_rc.i [2025-03-14 01:35:05,100 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:35:05,102 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-03-14 01:35:05,103 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:35:05,169 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:35:05,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 273 transitions, 560 flow [2025-03-14 01:35:05,297 INFO L124 PetriNetUnfolderBase]: 38/271 cut-off events. [2025-03-14 01:35:05,299 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:35:05,307 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 889 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-03-14 01:35:05,307 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 273 transitions, 560 flow [2025-03-14 01:35:05,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 234 places, 263 transitions, 538 flow [2025-03-14 01:35:05,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:35:05,334 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;@6c2c707f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:35:05,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-14 01:35:05,343 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:35:05,343 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-14 01:35:05,343 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:35:05,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:05,345 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-03-14 01:35:05,345 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-03-14 01:35:05,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:05,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2119913943, now seen corresponding path program 1 times [2025-03-14 01:35:05,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:05,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031816403] [2025-03-14 01:35:05,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:05,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:05,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:35:05,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:35:05,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:05,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:05,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:05,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031816403] [2025-03-14 01:35:05,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031816403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:05,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:05,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:35:05,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362958366] [2025-03-14 01:35:05,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:05,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:05,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:05,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:05,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:35:05,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 273 [2025-03-14 01:35:05,723 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-03-14 01:35:05,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:05,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 273 [2025-03-14 01:35:05,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:05,851 INFO L124 PetriNetUnfolderBase]: 46/541 cut-off events. [2025-03-14 01:35:05,851 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-14 01:35:05,856 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 2977 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-03-14 01:35:05,860 INFO L140 encePairwiseOnDemand]: 253/273 looper letters, 13 selfloop transitions, 2 changer transitions 9/230 dead transitions. [2025-03-14 01:35:05,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 230 transitions, 502 flow [2025-03-14 01:35:05,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:05,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2025-03-14 01:35:05,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8827838827838828 [2025-03-14 01:35:05,879 INFO L175 Difference]: Start difference. First operand has 234 places, 263 transitions, 538 flow. Second operand 3 states and 723 transitions. [2025-03-14 01:35:05,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 230 transitions, 502 flow [2025-03-14 01:35:05,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 230 transitions, 494 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:35:05,889 INFO L231 Difference]: Finished difference. Result has 223 places, 221 transitions, 450 flow [2025-03-14 01:35:05,892 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-03-14 01:35:05,896 INFO L279 CegarLoopForPetriNet]: 234 programPoint places, -11 predicate places. [2025-03-14 01:35:05,896 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 221 transitions, 450 flow [2025-03-14 01:35:05,897 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-03-14 01:35:05,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:05,897 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-03-14 01:35:05,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:35:05,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting counter_threadErr4ASSERT_VIOLATIONDATA_RACE === [monitor_threadErr5ASSERT_VIOLATIONDATA_RACE, monitor_threadErr4ASSERT_VIOLATIONDATA_RACE, monitor_threadErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-14 01:35:05,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:05,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1980221503, now seen corresponding path program 1 times [2025-03-14 01:35:05,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:05,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557284645] [2025-03-14 01:35:05,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:05,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:05,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:35:05,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:35:05,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:05,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:05,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:05,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:05,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557284645] [2025-03-14 01:35:05,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557284645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:05,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:05,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:35:05,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420023339] [2025-03-14 01:35:05,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:05,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:05,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:05,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:05,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:35:06,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 273 [2025-03-14 01:35:06,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 221 transitions, 450 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-03-14 01:35:06,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:06,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 273 [2025-03-14 01:35:06,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:06,094 INFO L124 PetriNetUnfolderBase]: 67/705 cut-off events. [2025-03-14 01:35:06,095 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:35:06,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 705 events. 67/705 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4516 event pairs, 16 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 757. Up to 70 conditions per place. [2025-03-14 01:35:06,100 INFO L140 encePairwiseOnDemand]: 269/273 looper letters, 14 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-03-14 01:35:06,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 222 transitions, 485 flow [2025-03-14 01:35:06,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-14 01:35:06,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8717948717948718 [2025-03-14 01:35:06,102 INFO L175 Difference]: Start difference. First operand has 223 places, 221 transitions, 450 flow. Second operand 3 states and 714 transitions. [2025-03-14 01:35:06,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 222 transitions, 485 flow [2025-03-14 01:35:06,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 222 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:35:06,110 INFO L231 Difference]: Finished difference. Result has 214 places, 221 transitions, 456 flow [2025-03-14 01:35:06,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=214, PETRI_TRANSITIONS=221} [2025-03-14 01:35:06,111 INFO L279 CegarLoopForPetriNet]: 234 programPoint places, -20 predicate places. [2025-03-14 01:35:06,111 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 221 transitions, 456 flow [2025-03-14 01:35:06,112 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-03-14 01:35:06,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:06,112 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-03-14 01:35:06,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:35:06,112 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [monitor_threadErr5ASSERT_VIOLATIONDATA_RACE, monitor_threadErr4ASSERT_VIOLATIONDATA_RACE, monitor_threadErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-14 01:35:06,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:06,113 INFO L85 PathProgramCache]: Analyzing trace with hash 457796775, now seen corresponding path program 1 times [2025-03-14 01:35:06,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:06,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613937212] [2025-03-14 01:35:06,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:06,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:06,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:35:06,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:35:06,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:06,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:06,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:06,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613937212] [2025-03-14 01:35:06,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613937212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:06,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:06,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:35:06,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656469246] [2025-03-14 01:35:06,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:06,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:06,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:06,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:06,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:35:06,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 273 [2025-03-14 01:35:06,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 221 transitions, 456 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-03-14 01:35:06,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:06,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 273 [2025-03-14 01:35:06,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:06,407 INFO L124 PetriNetUnfolderBase]: 429/2235 cut-off events. [2025-03-14 01:35:06,407 INFO L125 PetriNetUnfolderBase]: For 8/13 co-relation queries the response was YES. [2025-03-14 01:35:06,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2749 conditions, 2235 events. 429/2235 cut-off events. For 8/13 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 19438 event pairs, 163 based on Foata normal form. 2/1918 useless extension candidates. Maximal degree in co-relation 2475. Up to 449 conditions per place. [2025-03-14 01:35:06,437 INFO L140 encePairwiseOnDemand]: 257/273 looper letters, 26 selfloop transitions, 7 changer transitions 6/226 dead transitions. [2025-03-14 01:35:06,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 226 transitions, 540 flow [2025-03-14 01:35:06,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:06,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:06,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2025-03-14 01:35:06,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8412698412698413 [2025-03-14 01:35:06,440 INFO L175 Difference]: Start difference. First operand has 214 places, 221 transitions, 456 flow. Second operand 3 states and 689 transitions. [2025-03-14 01:35:06,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 226 transitions, 540 flow [2025-03-14 01:35:06,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 226 transitions, 540 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:35:06,444 INFO L231 Difference]: Finished difference. Result has 209 places, 214 transitions, 474 flow [2025-03-14 01:35:06,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=209, PETRI_TRANSITIONS=214} [2025-03-14 01:35:06,445 INFO L279 CegarLoopForPetriNet]: 234 programPoint places, -25 predicate places. [2025-03-14 01:35:06,446 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 214 transitions, 474 flow [2025-03-14 01:35:06,446 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-03-14 01:35:06,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:06,446 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-03-14 01:35:06,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:35:06,447 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-03-14 01:35:06,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:06,447 INFO L85 PathProgramCache]: Analyzing trace with hash -982321140, now seen corresponding path program 1 times [2025-03-14 01:35:06,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:06,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552611104] [2025-03-14 01:35:06,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:06,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:06,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-14 01:35:06,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-14 01:35:06,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:06,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:06,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:06,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:06,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552611104] [2025-03-14 01:35:06,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552611104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:06,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:06,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:35:06,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657649414] [2025-03-14 01:35:06,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:06,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:06,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:06,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:06,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:35:06,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 273 [2025-03-14 01:35:06,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 214 transitions, 474 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-03-14 01:35:06,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:06,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 273 [2025-03-14 01:35:06,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:06,801 INFO L124 PetriNetUnfolderBase]: 281/2044 cut-off events. [2025-03-14 01:35:06,801 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 01:35:06,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2518 conditions, 2044 events. 281/2044 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 16574 event pairs, 31 based on Foata normal form. 0/1795 useless extension candidates. Maximal degree in co-relation 2317. Up to 162 conditions per place. [2025-03-14 01:35:06,817 INFO L140 encePairwiseOnDemand]: 262/273 looper letters, 24 selfloop transitions, 8 changer transitions 0/228 dead transitions. [2025-03-14 01:35:06,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 228 transitions, 568 flow [2025-03-14 01:35:06,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2025-03-14 01:35:06,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8778998778998779 [2025-03-14 01:35:06,820 INFO L175 Difference]: Start difference. First operand has 209 places, 214 transitions, 474 flow. Second operand 3 states and 719 transitions. [2025-03-14 01:35:06,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 228 transitions, 568 flow [2025-03-14 01:35:06,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 228 transitions, 568 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:35:06,825 INFO L231 Difference]: Finished difference. Result has 208 places, 222 transitions, 544 flow [2025-03-14 01:35:06,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=208, PETRI_TRANSITIONS=222} [2025-03-14 01:35:06,827 INFO L279 CegarLoopForPetriNet]: 234 programPoint places, -26 predicate places. [2025-03-14 01:35:06,828 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 222 transitions, 544 flow [2025-03-14 01:35:06,828 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-03-14 01:35:06,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:06,828 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-03-14 01:35:06,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:35:06,829 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-03-14 01:35:06,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:06,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1017685631, now seen corresponding path program 1 times [2025-03-14 01:35:06,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:06,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190591115] [2025-03-14 01:35:06,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:06,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:06,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-14 01:35:06,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-14 01:35:06,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:06,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:06,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:06,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190591115] [2025-03-14 01:35:06,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190591115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:06,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:06,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:35:06,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414266120] [2025-03-14 01:35:06,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:06,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:06,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:06,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:06,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:35:06,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 273 [2025-03-14 01:35:06,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 222 transitions, 544 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-03-14 01:35:06,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:06,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 273 [2025-03-14 01:35:06,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:07,250 INFO L124 PetriNetUnfolderBase]: 481/3327 cut-off events. [2025-03-14 01:35:07,251 INFO L125 PetriNetUnfolderBase]: For 302/318 co-relation queries the response was YES. [2025-03-14 01:35:07,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4335 conditions, 3327 events. 481/3327 cut-off events. For 302/318 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 30786 event pairs, 57 based on Foata normal form. 7/2927 useless extension candidates. Maximal degree in co-relation 4124. Up to 280 conditions per place. [2025-03-14 01:35:07,277 INFO L140 encePairwiseOnDemand]: 266/273 looper letters, 23 selfloop transitions, 11 changer transitions 0/236 dead transitions. [2025-03-14 01:35:07,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 236 transitions, 664 flow [2025-03-14 01:35:07,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:07,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2025-03-14 01:35:07,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8791208791208791 [2025-03-14 01:35:07,279 INFO L175 Difference]: Start difference. First operand has 208 places, 222 transitions, 544 flow. Second operand 3 states and 720 transitions. [2025-03-14 01:35:07,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 236 transitions, 664 flow [2025-03-14 01:35:07,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 236 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:35:07,286 INFO L231 Difference]: Finished difference. Result has 210 places, 230 transitions, 620 flow [2025-03-14 01:35:07,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=210, PETRI_TRANSITIONS=230} [2025-03-14 01:35:07,288 INFO L279 CegarLoopForPetriNet]: 234 programPoint places, -24 predicate places. [2025-03-14 01:35:07,288 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 230 transitions, 620 flow [2025-03-14 01:35:07,289 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-03-14 01:35:07,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:07,289 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-03-14 01:35:07,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:35:07,290 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-03-14 01:35:07,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:07,291 INFO L85 PathProgramCache]: Analyzing trace with hash 696105011, now seen corresponding path program 1 times [2025-03-14 01:35:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:07,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330873391] [2025-03-14 01:35:07,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:07,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:07,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-14 01:35:07,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-14 01:35:07,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:07,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:07,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:07,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330873391] [2025-03-14 01:35:07,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330873391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:07,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:07,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:35:07,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047233302] [2025-03-14 01:35:07,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:07,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:07,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:07,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:07,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:35:07,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 273 [2025-03-14 01:35:07,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 230 transitions, 620 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-03-14 01:35:07,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:07,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 273 [2025-03-14 01:35:07,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:07,818 INFO L124 PetriNetUnfolderBase]: 606/4064 cut-off events. [2025-03-14 01:35:07,818 INFO L125 PetriNetUnfolderBase]: For 825/845 co-relation queries the response was YES. [2025-03-14 01:35:07,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5522 conditions, 4064 events. 606/4064 cut-off events. For 825/845 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 39425 event pairs, 78 based on Foata normal form. 3/3558 useless extension candidates. Maximal degree in co-relation 5252. Up to 339 conditions per place. [2025-03-14 01:35:07,843 INFO L140 encePairwiseOnDemand]: 266/273 looper letters, 27 selfloop transitions, 14 changer transitions 0/244 dead transitions. [2025-03-14 01:35:07,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 244 transitions, 775 flow [2025-03-14 01:35:07,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-03-14 01:35:07,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766788766788767 [2025-03-14 01:35:07,845 INFO L175 Difference]: Start difference. First operand has 210 places, 230 transitions, 620 flow. Second operand 3 states and 718 transitions. [2025-03-14 01:35:07,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 244 transitions, 775 flow [2025-03-14 01:35:07,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 244 transitions, 745 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:35:07,850 INFO L231 Difference]: Finished difference. Result has 212 places, 240 transitions, 732 flow [2025-03-14 01:35:07,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=212, PETRI_TRANSITIONS=240} [2025-03-14 01:35:07,851 INFO L279 CegarLoopForPetriNet]: 234 programPoint places, -22 predicate places. [2025-03-14 01:35:07,851 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 240 transitions, 732 flow [2025-03-14 01:35:07,851 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-03-14 01:35:07,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:07,851 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-03-14 01:35:07,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:35:07,852 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-03-14 01:35:07,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash -887957665, now seen corresponding path program 1 times [2025-03-14 01:35:07,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:07,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486808416] [2025-03-14 01:35:07,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:07,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:07,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-14 01:35:07,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-14 01:35:07,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:07,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:35:07,882 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:35:07,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-14 01:35:07,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-14 01:35:07,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:07,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:35:07,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:35:07,924 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:35:07,925 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location monitor_threadErr4ASSERT_VIOLATIONDATA_RACE (28 of 29 remaining) [2025-03-14 01:35:07,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr5ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-03-14 01:35:07,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr4ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-03-14 01:35:07,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-03-14 01:35:07,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr1ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-03-14 01:35:07,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr3ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-03-14 01:35:07,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr0ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-03-14 01:35:07,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr4ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-03-14 01:35:07,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr3ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-03-14 01:35:07,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr2ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-03-14 01:35:07,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr1ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-03-14 01:35:07,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr0ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-03-14 01:35:07,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-03-14 01:35:07,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-03-14 01:35:07,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-03-14 01:35:07,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2025-03-14 01:35:07,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2025-03-14 01:35:07,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 29 remaining) [2025-03-14 01:35:07,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 29 remaining) [2025-03-14 01:35:07,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr5ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-03-14 01:35:07,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr2ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-03-14 01:35:07,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-03-14 01:35:07,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-03-14 01:35:07,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location monitor_threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-03-14 01:35:07,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-03-14 01:35:07,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-03-14 01:35:07,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-03-14 01:35:07,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-03-14 01:35:07,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location counter_threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-03-14 01:35:07,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:35:07,931 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:07,989 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:35:07,989 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:35:07,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:35:07 BasicIcfg [2025-03-14 01:35:07,993 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:35:07,993 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:35:07,993 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:35:07,993 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:35:07,994 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:05" (3/4) ... [2025-03-14 01:35:07,995 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-14 01:35:08,046 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-14 01:35:08,080 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:35:08,082 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:35:08,082 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:35:08,082 INFO L158 Benchmark]: Toolchain (without parser) took 4294.83ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 109.5MB in the beginning and 67.3MB in the end (delta: 42.2MB). Peak memory consumption was 127.6MB. Max. memory is 16.1GB. [2025-03-14 01:35:08,082 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 226.5MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:35:08,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 680.22ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 51.1MB in the end (delta: 57.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-14 01:35:08,083 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.29ms. Allocated memory is still 142.6MB. Free memory was 51.1MB in the beginning and 48.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:35:08,083 INFO L158 Benchmark]: Boogie Preprocessor took 36.93ms. Allocated memory is still 142.6MB. Free memory was 48.5MB in the beginning and 45.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:35:08,083 INFO L158 Benchmark]: IcfgBuilder took 526.73ms. Allocated memory is still 142.6MB. Free memory was 45.8MB in the beginning and 85.1MB in the end (delta: -39.3MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2025-03-14 01:35:08,083 INFO L158 Benchmark]: TraceAbstraction took 2908.98ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 84.3MB in the beginning and 86.4MB in the end (delta: -2.0MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. [2025-03-14 01:35:08,083 INFO L158 Benchmark]: Witness Printer took 88.37ms. Allocated memory is still 226.5MB. Free memory was 86.4MB in the beginning and 67.3MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:35:08,084 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.28ms. Allocated memory is still 226.5MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 680.22ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 51.1MB in the end (delta: 57.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.29ms. Allocated memory is still 142.6MB. Free memory was 51.1MB in the beginning and 48.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.93ms. Allocated memory is still 142.6MB. Free memory was 48.5MB in the beginning and 45.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 526.73ms. Allocated memory is still 142.6MB. Free memory was 45.8MB in the beginning and 85.1MB in the end (delta: -39.3MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2908.98ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 84.3MB in the beginning and 86.4MB in the end (delta: -2.0MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. * Witness Printer took 88.37ms. Allocated memory is still 226.5MB. Free memory was 86.4MB in the beginning and 67.3MB in the end (delta: 19.1MB). 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: 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. - 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. - 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.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 32 mSDtfsCounter, 204 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=732occurred 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-03-14 01:35:08,099 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(DATA-RACE)