./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-outer-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-outer-race.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 47827fdca8ccc83dae99015d656cdcf2872ea585121905304e5ffb2ef40b4eac --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:31:47,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:31:47,326 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:31:47,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:31:47,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:31:47,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:31:47,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:31:47,351 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:31:47,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:31:47,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:31:47,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:31:47,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:31:47,352 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:31:47,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:31:47,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:31:47,352 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:31:47,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:31:47,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:31:47,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:31:47,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:31:47,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:31:47,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:31:47,353 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:31:47,353 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:31:47,353 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:31:47,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:31:47,353 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:31:47,353 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:31:47,353 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:31:47,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:31:47,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:31:47,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:31:47,354 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:31:47,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:31:47,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:31:47,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:31:47,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:31:47,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:31:47,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:31:47,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:31:47,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:31:47,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:31:47,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:31:47,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:31:47,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:31:47,355 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 -> 47827fdca8ccc83dae99015d656cdcf2872ea585121905304e5ffb2ef40b4eac [2025-04-30 10:31:47,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:31:47,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:31:47,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:31:47,590 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:31:47,590 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:31:47,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-outer-race.i [2025-04-30 10:31:48,902 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fab4b77ff/2d3cc4e038f843b68abf5b5b4a4e6c5a/FLAG92ffad1cb [2025-04-30 10:31:49,139 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:31:49,140 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-outer-race.i [2025-04-30 10:31:49,153 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fab4b77ff/2d3cc4e038f843b68abf5b5b4a4e6c5a/FLAG92ffad1cb [2025-04-30 10:31:49,953 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fab4b77ff/2d3cc4e038f843b68abf5b5b4a4e6c5a [2025-04-30 10:31:49,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:31:49,956 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:31:49,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:31:49,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:31:49,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:31:49,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:31:49" (1/1) ... [2025-04-30 10:31:49,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79ce78ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:49, skipping insertion in model container [2025-04-30 10:31:49,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:31:49" (1/1) ... [2025-04-30 10:31:49,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:31:50,250 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:31:50,260 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:31:50,307 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:31:50,335 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:31:50,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:50 WrapperNode [2025-04-30 10:31:50,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:31:50,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:31:50,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:31:50,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:31:50,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:50" (1/1) ... [2025-04-30 10:31:50,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:50" (1/1) ... [2025-04-30 10:31:50,367 INFO L138 Inliner]: procedures = 159, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2025-04-30 10:31:50,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:31:50,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:31:50,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:31:50,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:31:50,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:50" (1/1) ... [2025-04-30 10:31:50,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:50" (1/1) ... [2025-04-30 10:31:50,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:50" (1/1) ... [2025-04-30 10:31:50,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:50" (1/1) ... [2025-04-30 10:31:50,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:50" (1/1) ... [2025-04-30 10:31:50,377 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:50" (1/1) ... [2025-04-30 10:31:50,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:50" (1/1) ... [2025-04-30 10:31:50,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:50" (1/1) ... [2025-04-30 10:31:50,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:50" (1/1) ... [2025-04-30 10:31:50,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:31:50,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:31:50,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:31:50,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:31:50,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:50" (1/1) ... [2025-04-30 10:31:50,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:31:50,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:31:50,412 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-04-30 10:31:50,417 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-04-30 10:31:50,433 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:31:50,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:31:50,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:31:50,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-30 10:31:50,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-30 10:31:50,434 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:31:50,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:31:50,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:31:50,435 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:31:50,511 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:31:50,512 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:31:50,637 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:31:50,638 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:31:50,656 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:31:50,657 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:31:50,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:31:50 BoogieIcfgContainer [2025-04-30 10:31:50,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:31:50,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:31:50,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:31:50,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:31:50,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:31:49" (1/3) ... [2025-04-30 10:31:50,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3190a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:31:50, skipping insertion in model container [2025-04-30 10:31:50,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:50" (2/3) ... [2025-04-30 10:31:50,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3190a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:31:50, skipping insertion in model container [2025-04-30 10:31:50,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:31:50" (3/3) ... [2025-04-30 10:31:50,665 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race.i [2025-04-30 10:31:50,676 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:31:50,677 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer-race.i that has 2 procedures, 91 locations, 93 edges, 1 initial locations, 2 loop locations, and 7 error locations. [2025-04-30 10:31:50,678 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:31:50,725 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:31:50,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 94 transitions, 192 flow [2025-04-30 10:31:50,811 INFO L116 PetriNetUnfolderBase]: 5/125 cut-off events. [2025-04-30 10:31:50,812 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:50,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 125 events. 5/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 184 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 66. Up to 4 conditions per place. [2025-04-30 10:31:50,817 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 94 transitions, 192 flow [2025-04-30 10:31:50,821 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 94 transitions, 192 flow [2025-04-30 10:31:50,828 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:31:50,837 INFO L340 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;@1a1379f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:31:50,837 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-30 10:31:50,844 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:31:50,844 INFO L116 PetriNetUnfolderBase]: 1/32 cut-off events. [2025-04-30 10:31:50,844 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:50,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:50,845 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] [2025-04-30 10:31:50,845 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:31:50,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:50,852 INFO L85 PathProgramCache]: Analyzing trace with hash 475140232, now seen corresponding path program 1 times [2025-04-30 10:31:50,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:50,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069740257] [2025-04-30 10:31:50,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:50,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:50,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:31:50,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:31:50,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:50,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:51,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:51,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069740257] [2025-04-30 10:31:51,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069740257] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:51,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:51,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788644512] [2025-04-30 10:31:51,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:51,049 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:51,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:51,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:51,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:51,095 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 94 [2025-04-30 10:31:51,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-04-30 10:31:51,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:51,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 94 [2025-04-30 10:31:51,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:51,191 INFO L116 PetriNetUnfolderBase]: 32/293 cut-off events. [2025-04-30 10:31:51,191 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:31:51,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 293 events. 32/293 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1181 event pairs, 7 based on Foata normal form. 1/263 useless extension candidates. Maximal degree in co-relation 310. Up to 59 conditions per place. [2025-04-30 10:31:51,199 INFO L140 encePairwiseOnDemand]: 81/94 looper letters, 16 selfloop transitions, 8 changer transitions 1/102 dead transitions. [2025-04-30 10:31:51,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 102 transitions, 256 flow [2025-04-30 10:31:51,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2025-04-30 10:31:51,212 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9361702127659575 [2025-04-30 10:31:51,213 INFO L175 Difference]: Start difference. First operand has 94 places, 94 transitions, 192 flow. Second operand 3 states and 264 transitions. [2025-04-30 10:31:51,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 102 transitions, 256 flow [2025-04-30 10:31:51,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 102 transitions, 256 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:31:51,219 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 256 flow [2025-04-30 10:31:51,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2025-04-30 10:31:51,223 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 4 predicate places. [2025-04-30 10:31:51,223 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 256 flow [2025-04-30 10:31:51,224 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-04-30 10:31:51,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:51,224 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] [2025-04-30 10:31:51,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:31:51,224 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:31:51,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:51,225 INFO L85 PathProgramCache]: Analyzing trace with hash 519321420, now seen corresponding path program 1 times [2025-04-30 10:31:51,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:51,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557582097] [2025-04-30 10:31:51,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:51,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:51,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:31:51,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:31:51,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:51,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:51,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:51,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557582097] [2025-04-30 10:31:51,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557582097] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:51,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:51,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:51,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200342771] [2025-04-30 10:31:51,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:51,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:51,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:51,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:51,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:51,306 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 94 [2025-04-30 10:31:51,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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-04-30 10:31:51,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:51,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 94 [2025-04-30 10:31:51,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:51,360 INFO L116 PetriNetUnfolderBase]: 27/311 cut-off events. [2025-04-30 10:31:51,360 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-30 10:31:51,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 311 events. 27/311 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1387 event pairs, 6 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 361. Up to 45 conditions per place. [2025-04-30 10:31:51,363 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 8 selfloop transitions, 3 changer transitions 0/103 dead transitions. [2025-04-30 10:31:51,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 286 flow [2025-04-30 10:31:51,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2025-04-30 10:31:51,364 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9468085106382979 [2025-04-30 10:31:51,364 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 256 flow. Second operand 3 states and 267 transitions. [2025-04-30 10:31:51,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 286 flow [2025-04-30 10:31:51,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 103 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:51,367 INFO L231 Difference]: Finished difference. Result has 99 places, 101 transitions, 262 flow [2025-04-30 10:31:51,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=99, PETRI_TRANSITIONS=101} [2025-04-30 10:31:51,367 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 5 predicate places. [2025-04-30 10:31:51,369 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 101 transitions, 262 flow [2025-04-30 10:31:51,370 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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-04-30 10:31:51,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:51,370 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] [2025-04-30 10:31:51,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:31:51,371 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:31:51,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:51,373 INFO L85 PathProgramCache]: Analyzing trace with hash 95997775, now seen corresponding path program 1 times [2025-04-30 10:31:51,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:51,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830063257] [2025-04-30 10:31:51,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:51,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:51,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:31:51,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:31:51,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:51,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:51,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:51,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830063257] [2025-04-30 10:31:51,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830063257] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:51,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:51,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:51,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470798401] [2025-04-30 10:31:51,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:51,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:51,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:51,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:51,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:51,469 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 94 [2025-04-30 10:31:51,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 101 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-04-30 10:31:51,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:51,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 94 [2025-04-30 10:31:51,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:51,534 INFO L116 PetriNetUnfolderBase]: 54/456 cut-off events. [2025-04-30 10:31:51,534 INFO L117 PetriNetUnfolderBase]: For 63/71 co-relation queries the response was YES. [2025-04-30 10:31:51,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 456 events. 54/456 cut-off events. For 63/71 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2504 event pairs, 23 based on Foata normal form. 4/416 useless extension candidates. Maximal degree in co-relation 627. Up to 104 conditions per place. [2025-04-30 10:31:51,538 INFO L140 encePairwiseOnDemand]: 88/94 looper letters, 19 selfloop transitions, 7 changer transitions 0/108 dead transitions. [2025-04-30 10:31:51,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 108 transitions, 334 flow [2025-04-30 10:31:51,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2025-04-30 10:31:51,540 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9042553191489362 [2025-04-30 10:31:51,541 INFO L175 Difference]: Start difference. First operand has 99 places, 101 transitions, 262 flow. Second operand 3 states and 255 transitions. [2025-04-30 10:31:51,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 108 transitions, 334 flow [2025-04-30 10:31:51,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 108 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:51,545 INFO L231 Difference]: Finished difference. Result has 101 places, 106 transitions, 312 flow [2025-04-30 10:31:51,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=101, PETRI_TRANSITIONS=106} [2025-04-30 10:31:51,546 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 7 predicate places. [2025-04-30 10:31:51,546 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 106 transitions, 312 flow [2025-04-30 10:31:51,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-04-30 10:31:51,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:51,547 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] [2025-04-30 10:31:51,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:31:51,547 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:31:51,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:51,547 INFO L85 PathProgramCache]: Analyzing trace with hash -172017348, now seen corresponding path program 1 times [2025-04-30 10:31:51,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:51,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828742115] [2025-04-30 10:31:51,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:51,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:51,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-30 10:31:51,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:31:51,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:51,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:51,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:51,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:51,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828742115] [2025-04-30 10:31:51,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828742115] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:51,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:51,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:51,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974350073] [2025-04-30 10:31:51,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:51,610 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:51,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:51,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:51,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:51,623 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 94 [2025-04-30 10:31:51,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 106 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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-04-30 10:31:51,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:51,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 94 [2025-04-30 10:31:51,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:51,653 INFO L116 PetriNetUnfolderBase]: 36/366 cut-off events. [2025-04-30 10:31:51,653 INFO L117 PetriNetUnfolderBase]: For 64/71 co-relation queries the response was YES. [2025-04-30 10:31:51,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 366 events. 36/366 cut-off events. For 64/71 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1944 event pairs, 8 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 495. Up to 51 conditions per place. [2025-04-30 10:31:51,655 INFO L140 encePairwiseOnDemand]: 89/94 looper letters, 8 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2025-04-30 10:31:51,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 109 transitions, 346 flow [2025-04-30 10:31:51,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-04-30 10:31:51,657 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9290780141843972 [2025-04-30 10:31:51,657 INFO L175 Difference]: Start difference. First operand has 101 places, 106 transitions, 312 flow. Second operand 3 states and 262 transitions. [2025-04-30 10:31:51,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 109 transitions, 346 flow [2025-04-30 10:31:51,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 109 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:51,659 INFO L231 Difference]: Finished difference. Result has 103 places, 109 transitions, 334 flow [2025-04-30 10:31:51,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=103, PETRI_TRANSITIONS=109} [2025-04-30 10:31:51,660 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 9 predicate places. [2025-04-30 10:31:51,660 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 109 transitions, 334 flow [2025-04-30 10:31:51,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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-04-30 10:31:51,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:51,661 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-04-30 10:31:51,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:31:51,661 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:31:51,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:51,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1535942361, now seen corresponding path program 1 times [2025-04-30 10:31:51,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:51,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516252978] [2025-04-30 10:31:51,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:51,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:51,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:31:51,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:31:51,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:51,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:51,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:51,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516252978] [2025-04-30 10:31:51,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516252978] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:51,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:51,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:51,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575524049] [2025-04-30 10:31:51,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:51,736 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:51,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:51,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:51,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:51,763 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 94 [2025-04-30 10:31:51,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 109 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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-04-30 10:31:51,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:51,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 94 [2025-04-30 10:31:51,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:51,807 INFO L116 PetriNetUnfolderBase]: 64/479 cut-off events. [2025-04-30 10:31:51,807 INFO L117 PetriNetUnfolderBase]: For 156/164 co-relation queries the response was YES. [2025-04-30 10:31:51,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 479 events. 64/479 cut-off events. For 156/164 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2730 event pairs, 13 based on Foata normal form. 1/447 useless extension candidates. Maximal degree in co-relation 796. Up to 109 conditions per place. [2025-04-30 10:31:51,810 INFO L140 encePairwiseOnDemand]: 87/94 looper letters, 16 selfloop transitions, 11 changer transitions 1/116 dead transitions. [2025-04-30 10:31:51,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 116 transitions, 416 flow [2025-04-30 10:31:51,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2025-04-30 10:31:51,812 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9148936170212766 [2025-04-30 10:31:51,812 INFO L175 Difference]: Start difference. First operand has 103 places, 109 transitions, 334 flow. Second operand 3 states and 258 transitions. [2025-04-30 10:31:51,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 116 transitions, 416 flow [2025-04-30 10:31:51,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 116 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:51,815 INFO L231 Difference]: Finished difference. Result has 105 places, 115 transitions, 408 flow [2025-04-30 10:31:51,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=105, PETRI_TRANSITIONS=115} [2025-04-30 10:31:51,817 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 11 predicate places. [2025-04-30 10:31:51,817 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 115 transitions, 408 flow [2025-04-30 10:31:51,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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-04-30 10:31:51,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:51,818 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] [2025-04-30 10:31:51,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:31:51,818 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:31:51,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:51,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1128229663, now seen corresponding path program 1 times [2025-04-30 10:31:51,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:51,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246750363] [2025-04-30 10:31:51,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:51,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-30 10:31:51,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-30 10:31:51,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:51,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:51,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:51,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246750363] [2025-04-30 10:31:51,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246750363] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:51,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:51,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:31:51,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153754753] [2025-04-30 10:31:51,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:51,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:31:51,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:51,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:31:51,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:31:51,978 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 94 [2025-04-30 10:31:51,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 115 transitions, 408 flow. Second operand has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 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-04-30 10:31:51,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:51,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 94 [2025-04-30 10:31:51,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:52,051 INFO L116 PetriNetUnfolderBase]: 68/463 cut-off events. [2025-04-30 10:31:52,052 INFO L117 PetriNetUnfolderBase]: For 238/248 co-relation queries the response was YES. [2025-04-30 10:31:52,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 463 events. 68/463 cut-off events. For 238/248 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2590 event pairs, 13 based on Foata normal form. 3/438 useless extension candidates. Maximal degree in co-relation 818. Up to 65 conditions per place. [2025-04-30 10:31:52,054 INFO L140 encePairwiseOnDemand]: 87/94 looper letters, 14 selfloop transitions, 7 changer transitions 1/119 dead transitions. [2025-04-30 10:31:52,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 119 transitions, 444 flow [2025-04-30 10:31:52,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 504 transitions. [2025-04-30 10:31:52,056 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8936170212765957 [2025-04-30 10:31:52,056 INFO L175 Difference]: Start difference. First operand has 105 places, 115 transitions, 408 flow. Second operand 6 states and 504 transitions. [2025-04-30 10:31:52,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 119 transitions, 444 flow [2025-04-30 10:31:52,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 119 transitions, 408 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-04-30 10:31:52,061 INFO L231 Difference]: Finished difference. Result has 105 places, 114 transitions, 386 flow [2025-04-30 10:31:52,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=105, PETRI_TRANSITIONS=114} [2025-04-30 10:31:52,062 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 11 predicate places. [2025-04-30 10:31:52,063 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 114 transitions, 386 flow [2025-04-30 10:31:52,063 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 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-04-30 10:31:52,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:52,063 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:52,063 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:31:52,064 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:31:52,064 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:52,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1663866667, now seen corresponding path program 1 times [2025-04-30 10:31:52,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:52,064 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888943488] [2025-04-30 10:31:52,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:52,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:52,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-30 10:31:52,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-30 10:31:52,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:52,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:52,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:31:52,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-30 10:31:52,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-30 10:31:52,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:52,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:52,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:31:52,117 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:31:52,117 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-04-30 10:31:52,118 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-04-30 10:31:52,118 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-04-30 10:31:52,118 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-04-30 10:31:52,119 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-04-30 10:31:52,119 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-04-30 10:31:52,119 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-04-30 10:31:52,119 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-04-30 10:31:52,119 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-04-30 10:31:52,119 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-04-30 10:31:52,119 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-04-30 10:31:52,119 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:31:52,119 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:52,122 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:31:52,122 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-30 10:31:52,138 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:31:52,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 122 transitions, 254 flow [2025-04-30 10:31:52,156 INFO L116 PetriNetUnfolderBase]: 7/192 cut-off events. [2025-04-30 10:31:52,156 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:31:52,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 192 events. 7/192 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 325 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 126. Up to 6 conditions per place. [2025-04-30 10:31:52,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 122 transitions, 254 flow [2025-04-30 10:31:52,158 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 122 transitions, 254 flow [2025-04-30 10:31:52,159 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:31:52,159 INFO L340 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;@1a1379f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:31:52,160 INFO L341 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-04-30 10:31:52,162 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:31:52,162 INFO L116 PetriNetUnfolderBase]: 1/32 cut-off events. [2025-04-30 10:31:52,162 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:52,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:52,162 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] [2025-04-30 10:31:52,162 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:31:52,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:52,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1157198530, now seen corresponding path program 1 times [2025-04-30 10:31:52,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:52,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343630868] [2025-04-30 10:31:52,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:52,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:52,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:31:52,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:31:52,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:52,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:52,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:52,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343630868] [2025-04-30 10:31:52,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343630868] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:52,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:52,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:52,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541493674] [2025-04-30 10:31:52,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:52,183 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:52,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:52,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:52,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:52,204 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 122 [2025-04-30 10:31:52,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 122 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-04-30 10:31:52,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:52,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 122 [2025-04-30 10:31:52,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:52,389 INFO L116 PetriNetUnfolderBase]: 563/2345 cut-off events. [2025-04-30 10:31:52,389 INFO L117 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-04-30 10:31:52,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 2345 events. 563/2345 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 19528 event pairs, 195 based on Foata normal form. 1/2089 useless extension candidates. Maximal degree in co-relation 2679. Up to 666 conditions per place. [2025-04-30 10:31:52,399 INFO L140 encePairwiseOnDemand]: 105/122 looper letters, 26 selfloop transitions, 11 changer transitions 1/136 dead transitions. [2025-04-30 10:31:52,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 136 transitions, 361 flow [2025-04-30 10:31:52,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2025-04-30 10:31:52,400 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9316939890710383 [2025-04-30 10:31:52,400 INFO L175 Difference]: Start difference. First operand has 124 places, 122 transitions, 254 flow. Second operand 3 states and 341 transitions. [2025-04-30 10:31:52,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 136 transitions, 361 flow [2025-04-30 10:31:52,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 136 transitions, 361 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:31:52,402 INFO L231 Difference]: Finished difference. Result has 128 places, 130 transitions, 344 flow [2025-04-30 10:31:52,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=128, PETRI_TRANSITIONS=130} [2025-04-30 10:31:52,403 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 4 predicate places. [2025-04-30 10:31:52,403 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 130 transitions, 344 flow [2025-04-30 10:31:52,403 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-04-30 10:31:52,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:52,403 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] [2025-04-30 10:31:52,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:31:52,404 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:31:52,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:52,404 INFO L85 PathProgramCache]: Analyzing trace with hash 75840262, now seen corresponding path program 1 times [2025-04-30 10:31:52,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:52,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140596131] [2025-04-30 10:31:52,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:52,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:52,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:31:52,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:31:52,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:52,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:52,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:52,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140596131] [2025-04-30 10:31:52,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140596131] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:52,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:52,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:52,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692661079] [2025-04-30 10:31:52,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:52,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:52,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:52,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:52,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:52,432 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 122 [2025-04-30 10:31:52,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 130 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-04-30 10:31:52,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:52,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 122 [2025-04-30 10:31:52,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:52,636 INFO L116 PetriNetUnfolderBase]: 487/2652 cut-off events. [2025-04-30 10:31:52,637 INFO L117 PetriNetUnfolderBase]: For 239/249 co-relation queries the response was YES. [2025-04-30 10:31:52,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4054 conditions, 2652 events. 487/2652 cut-off events. For 239/249 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 24700 event pairs, 174 based on Foata normal form. 0/2370 useless extension candidates. Maximal degree in co-relation 3290. Up to 500 conditions per place. [2025-04-30 10:31:52,652 INFO L140 encePairwiseOnDemand]: 117/122 looper letters, 14 selfloop transitions, 4 changer transitions 0/137 dead transitions. [2025-04-30 10:31:52,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 137 transitions, 394 flow [2025-04-30 10:31:52,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2025-04-30 10:31:52,653 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9453551912568307 [2025-04-30 10:31:52,653 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 344 flow. Second operand 3 states and 346 transitions. [2025-04-30 10:31:52,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 137 transitions, 394 flow [2025-04-30 10:31:52,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 137 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:52,658 INFO L231 Difference]: Finished difference. Result has 129 places, 133 transitions, 352 flow [2025-04-30 10:31:52,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=129, PETRI_TRANSITIONS=133} [2025-04-30 10:31:52,659 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 5 predicate places. [2025-04-30 10:31:52,659 INFO L485 AbstractCegarLoop]: Abstraction has has 129 places, 133 transitions, 352 flow [2025-04-30 10:31:52,659 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-04-30 10:31:52,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:52,659 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] [2025-04-30 10:31:52,659 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:31:52,659 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:31:52,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:52,660 INFO L85 PathProgramCache]: Analyzing trace with hash -767016113, now seen corresponding path program 1 times [2025-04-30 10:31:52,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:52,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530613610] [2025-04-30 10:31:52,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:52,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:52,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:31:52,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:31:52,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:52,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:52,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:52,686 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530613610] [2025-04-30 10:31:52,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530613610] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:52,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:52,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:52,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135554388] [2025-04-30 10:31:52,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:52,686 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:52,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:52,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:52,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:52,718 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 122 [2025-04-30 10:31:52,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 133 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-04-30 10:31:52,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:52,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 122 [2025-04-30 10:31:52,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:52,832 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([257] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][35], [69#L704-1true, Black: 134#(= |#race~data~0| 0), 132#true, 83#L689-3true, 37#L692-2true, 137#true, Black: 127#true, 123#true, 125#true]) [2025-04-30 10:31:52,833 INFO L286 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2025-04-30 10:31:52,833 INFO L289 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-04-30 10:31:52,833 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-30 10:31:52,833 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-30 10:31:52,947 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([257] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][35], [Black: 134#(= |#race~data~0| 0), 69#L704-1true, 8#L691-3true, 132#true, 37#L692-2true, 137#true, Black: 127#true, 123#true, 125#true]) [2025-04-30 10:31:52,948 INFO L286 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-04-30 10:31:52,948 INFO L289 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-04-30 10:31:52,948 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:52,948 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:53,130 INFO L116 PetriNetUnfolderBase]: 1078/4632 cut-off events. [2025-04-30 10:31:53,130 INFO L117 PetriNetUnfolderBase]: For 832/973 co-relation queries the response was YES. [2025-04-30 10:31:53,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7774 conditions, 4632 events. 1078/4632 cut-off events. For 832/973 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 46213 event pairs, 540 based on Foata normal form. 39/4073 useless extension candidates. Maximal degree in co-relation 6529. Up to 1374 conditions per place. [2025-04-30 10:31:53,163 INFO L140 encePairwiseOnDemand]: 114/122 looper letters, 28 selfloop transitions, 12 changer transitions 0/147 dead transitions. [2025-04-30 10:31:53,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 147 transitions, 476 flow [2025-04-30 10:31:53,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2025-04-30 10:31:53,165 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9098360655737705 [2025-04-30 10:31:53,165 INFO L175 Difference]: Start difference. First operand has 129 places, 133 transitions, 352 flow. Second operand 3 states and 333 transitions. [2025-04-30 10:31:53,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 147 transitions, 476 flow [2025-04-30 10:31:53,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 147 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:53,170 INFO L231 Difference]: Finished difference. Result has 131 places, 143 transitions, 450 flow [2025-04-30 10:31:53,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=131, PETRI_TRANSITIONS=143} [2025-04-30 10:31:53,171 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 7 predicate places. [2025-04-30 10:31:53,172 INFO L485 AbstractCegarLoop]: Abstraction has has 131 places, 143 transitions, 450 flow [2025-04-30 10:31:53,172 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-04-30 10:31:53,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:53,173 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] [2025-04-30 10:31:53,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:31:53,173 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:31:53,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:53,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1648842113, now seen corresponding path program 1 times [2025-04-30 10:31:53,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:53,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704416894] [2025-04-30 10:31:53,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:53,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:53,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-30 10:31:53,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:31:53,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:53,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:53,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:53,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704416894] [2025-04-30 10:31:53,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704416894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:53,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:53,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:53,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217419735] [2025-04-30 10:31:53,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:53,222 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:53,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:53,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:53,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:53,237 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 122 [2025-04-30 10:31:53,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 143 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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-04-30 10:31:53,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:53,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 122 [2025-04-30 10:31:53,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:53,490 INFO L116 PetriNetUnfolderBase]: 733/3801 cut-off events. [2025-04-30 10:31:53,491 INFO L117 PetriNetUnfolderBase]: For 987/1223 co-relation queries the response was YES. [2025-04-30 10:31:53,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6464 conditions, 3801 events. 733/3801 cut-off events. For 987/1223 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 39012 event pairs, 213 based on Foata normal form. 3/3334 useless extension candidates. Maximal degree in co-relation 4163. Up to 665 conditions per place. [2025-04-30 10:31:53,509 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 16 selfloop transitions, 7 changer transitions 0/151 dead transitions. [2025-04-30 10:31:53,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 151 transitions, 523 flow [2025-04-30 10:31:53,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-04-30 10:31:53,511 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9344262295081968 [2025-04-30 10:31:53,511 INFO L175 Difference]: Start difference. First operand has 131 places, 143 transitions, 450 flow. Second operand 3 states and 342 transitions. [2025-04-30 10:31:53,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 151 transitions, 523 flow [2025-04-30 10:31:53,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 151 transitions, 499 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:53,517 INFO L231 Difference]: Finished difference. Result has 133 places, 148 transitions, 482 flow [2025-04-30 10:31:53,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=133, PETRI_TRANSITIONS=148} [2025-04-30 10:31:53,518 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 9 predicate places. [2025-04-30 10:31:53,519 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 148 transitions, 482 flow [2025-04-30 10:31:53,519 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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-04-30 10:31:53,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:53,519 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-04-30 10:31:53,519 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:31:53,519 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:31:53,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:53,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1432046596, now seen corresponding path program 1 times [2025-04-30 10:31:53,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:53,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887200349] [2025-04-30 10:31:53,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:53,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:53,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:31:53,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:31:53,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:53,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:53,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:53,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887200349] [2025-04-30 10:31:53,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887200349] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:53,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:53,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:53,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632727518] [2025-04-30 10:31:53,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:53,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:53,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:53,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:53,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:53,593 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 122 [2025-04-30 10:31:53,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 148 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-04-30 10:31:53,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:53,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 122 [2025-04-30 10:31:53,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:53,674 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([257] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][35], [Black: 134#(= |#race~data~0| 0), 69#L704-1true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 147#true, 83#L689-3true, 37#L692-2true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 123#true, Black: 127#true, 142#true, 125#true]) [2025-04-30 10:31:53,674 INFO L286 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2025-04-30 10:31:53,674 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-30 10:31:53,674 INFO L289 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-04-30 10:31:53,674 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-30 10:31:53,774 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([257] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][35], [Black: 134#(= |#race~data~0| 0), 69#L704-1true, 8#L691-3true, 147#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 37#L692-2true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 123#true, 142#true, 125#true]) [2025-04-30 10:31:53,774 INFO L286 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-04-30 10:31:53,775 INFO L289 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-04-30 10:31:53,775 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:53,775 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:53,886 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([257] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][120], [69#L704-1true, Black: 134#(= |#race~data~0| 0), 147#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 110#L692-2true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 76#L692-7true, Black: 127#true, 123#true, 142#true, 125#true]) [2025-04-30 10:31:53,887 INFO L286 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-04-30 10:31:53,887 INFO L289 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-04-30 10:31:53,887 INFO L289 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-04-30 10:31:53,887 INFO L289 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-04-30 10:31:53,927 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([257] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][35], [69#L704-1true, Black: 134#(= |#race~data~0| 0), 147#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 110#L692-2true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 123#true, 53#L693true, 125#true, 142#true]) [2025-04-30 10:31:53,927 INFO L286 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-04-30 10:31:53,927 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-04-30 10:31:53,927 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-04-30 10:31:53,927 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:53,992 INFO L116 PetriNetUnfolderBase]: 1587/6317 cut-off events. [2025-04-30 10:31:53,993 INFO L117 PetriNetUnfolderBase]: For 3287/3541 co-relation queries the response was YES. [2025-04-30 10:31:54,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12392 conditions, 6317 events. 1587/6317 cut-off events. For 3287/3541 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 66507 event pairs, 516 based on Foata normal form. 46/5552 useless extension candidates. Maximal degree in co-relation 10314. Up to 1835 conditions per place. [2025-04-30 10:31:54,021 INFO L140 encePairwiseOnDemand]: 113/122 looper letters, 31 selfloop transitions, 19 changer transitions 0/166 dead transitions. [2025-04-30 10:31:54,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 166 transitions, 667 flow [2025-04-30 10:31:54,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:54,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2025-04-30 10:31:54,023 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9207650273224044 [2025-04-30 10:31:54,023 INFO L175 Difference]: Start difference. First operand has 133 places, 148 transitions, 482 flow. Second operand 3 states and 337 transitions. [2025-04-30 10:31:54,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 166 transitions, 667 flow [2025-04-30 10:31:54,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 166 transitions, 653 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:54,027 INFO L231 Difference]: Finished difference. Result has 135 places, 163 transitions, 650 flow [2025-04-30 10:31:54,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=135, PETRI_TRANSITIONS=163} [2025-04-30 10:31:54,029 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 11 predicate places. [2025-04-30 10:31:54,029 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 163 transitions, 650 flow [2025-04-30 10:31:54,029 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-04-30 10:31:54,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:54,029 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] [2025-04-30 10:31:54,029 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:31:54,029 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:31:54,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:54,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1654173478, now seen corresponding path program 1 times [2025-04-30 10:31:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:54,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225420783] [2025-04-30 10:31:54,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:54,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:54,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-30 10:31:54,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-30 10:31:54,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:54,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:54,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:54,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225420783] [2025-04-30 10:31:54,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225420783] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:54,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:54,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:31:54,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825825868] [2025-04-30 10:31:54,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:54,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:31:54,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:54,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:31:54,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:31:54,119 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 122 [2025-04-30 10:31:54,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 163 transitions, 650 flow. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 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-04-30 10:31:54,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:54,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 122 [2025-04-30 10:31:54,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:54,547 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([257] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][123], [Black: 134#(= |#race~data~0| 0), 69#L704-1true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 147#true, 110#L692-2true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 123#true, 76#L692-7true, Black: 127#true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 152#true, 125#true]) [2025-04-30 10:31:54,548 INFO L286 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-04-30 10:31:54,548 INFO L289 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-04-30 10:31:54,548 INFO L289 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-04-30 10:31:54,548 INFO L289 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-04-30 10:31:54,566 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([288] L699-5-->L699-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_3| |v_#race~threads_alive~0_4|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][129], [Black: 134#(= |#race~data~0| 0), Black: 129#(= |#race~threads_alive~0| 0), 147#true, Black: 137#true, 110#L692-2true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 63#L699-6true, 123#true, 76#L692-7true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 152#true, 125#true]) [2025-04-30 10:31:54,566 INFO L286 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2025-04-30 10:31:54,566 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:54,566 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:54,566 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:54,576 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([257] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][123], [69#L704-1true, Black: 134#(= |#race~data~0| 0), 147#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 110#L692-2true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 123#true, 76#L692-7true, Black: 127#true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 152#true, 125#true]) [2025-04-30 10:31:54,577 INFO L286 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-04-30 10:31:54,577 INFO L289 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-04-30 10:31:54,577 INFO L289 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-04-30 10:31:54,577 INFO L289 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-04-30 10:31:54,577 INFO L289 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-04-30 10:31:54,581 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([257] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][123], [69#L704-1true, Black: 134#(= |#race~data~0| 0), 147#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 80#L692-1true, 76#L692-7true, 123#true, Black: 127#true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 152#true, 125#true]) [2025-04-30 10:31:54,581 INFO L286 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-04-30 10:31:54,581 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-04-30 10:31:54,581 INFO L289 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-04-30 10:31:54,581 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-04-30 10:31:54,581 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([257] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][123], [69#L704-1true, Black: 134#(= |#race~data~0| 0), Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 147#true, 110#L692-2true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 76#L692-7true, 123#true, Black: 127#true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 152#true, 125#true]) [2025-04-30 10:31:54,582 INFO L286 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-04-30 10:31:54,582 INFO L289 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-04-30 10:31:54,582 INFO L289 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-04-30 10:31:54,582 INFO L289 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-04-30 10:31:54,582 INFO L289 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-04-30 10:31:54,582 INFO L289 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-04-30 10:31:54,615 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([257] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][74], [Black: 134#(= |#race~data~0| 0), 69#L704-1true, 147#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 110#L692-2true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 28#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 127#true, 123#true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 152#true, 125#true]) [2025-04-30 10:31:54,615 INFO L286 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-04-30 10:31:54,615 INFO L289 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-04-30 10:31:54,615 INFO L289 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-04-30 10:31:54,615 INFO L289 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-04-30 10:31:54,641 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([257] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][74], [69#L704-1true, Black: 134#(= |#race~data~0| 0), 147#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 110#L692-2true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 123#true, Black: 127#true, 53#L693true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 152#true, 125#true]) [2025-04-30 10:31:54,641 INFO L286 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-04-30 10:31:54,641 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-04-30 10:31:54,641 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-04-30 10:31:54,641 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:54,642 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([257] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][74], [69#L704-1true, Black: 134#(= |#race~data~0| 0), 147#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 110#L692-2true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 123#true, 53#L693true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 152#true, 125#true]) [2025-04-30 10:31:54,642 INFO L286 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-04-30 10:31:54,642 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-04-30 10:31:54,642 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-04-30 10:31:54,642 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:54,642 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:54,646 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([257] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][74], [69#L704-1true, Black: 134#(= |#race~data~0| 0), 147#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 110#L692-2true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 123#true, 53#L693true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 152#true, 125#true]) [2025-04-30 10:31:54,646 INFO L286 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-04-30 10:31:54,646 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-04-30 10:31:54,647 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:54,647 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-04-30 10:31:54,647 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:54,647 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:54,647 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([257] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][74], [69#L704-1true, Black: 134#(= |#race~data~0| 0), 147#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 80#L692-1true, Black: 127#true, 123#true, 53#L693true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 152#true, 125#true]) [2025-04-30 10:31:54,647 INFO L286 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2025-04-30 10:31:54,647 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:54,647 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:54,647 INFO L289 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-04-30 10:31:54,721 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([288] L699-5-->L699-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_3| |v_#race~threads_alive~0_4|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][37], [Black: 134#(= |#race~data~0| 0), Black: 129#(= |#race~threads_alive~0| 0), 147#true, Black: 137#true, 110#L692-2true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 63#L699-6true, 123#true, 53#L693true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 152#true, 125#true]) [2025-04-30 10:31:54,722 INFO L286 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2025-04-30 10:31:54,722 INFO L289 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-04-30 10:31:54,722 INFO L289 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-04-30 10:31:54,722 INFO L289 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-04-30 10:31:54,772 INFO L116 PetriNetUnfolderBase]: 2088/8386 cut-off events. [2025-04-30 10:31:54,772 INFO L117 PetriNetUnfolderBase]: For 5174/5808 co-relation queries the response was YES. [2025-04-30 10:31:54,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17053 conditions, 8386 events. 2088/8386 cut-off events. For 5174/5808 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 95662 event pairs, 536 based on Foata normal form. 51/7384 useless extension candidates. Maximal degree in co-relation 9495. Up to 1530 conditions per place. [2025-04-30 10:31:54,815 INFO L140 encePairwiseOnDemand]: 114/122 looper letters, 23 selfloop transitions, 9 changer transitions 1/180 dead transitions. [2025-04-30 10:31:54,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 180 transitions, 750 flow [2025-04-30 10:31:54,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 659 transitions. [2025-04-30 10:31:54,817 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9002732240437158 [2025-04-30 10:31:54,817 INFO L175 Difference]: Start difference. First operand has 135 places, 163 transitions, 650 flow. Second operand 6 states and 659 transitions. [2025-04-30 10:31:54,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 180 transitions, 750 flow [2025-04-30 10:31:54,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 180 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:54,832 INFO L231 Difference]: Finished difference. Result has 140 places, 170 transitions, 663 flow [2025-04-30 10:31:54,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=663, PETRI_PLACES=140, PETRI_TRANSITIONS=170} [2025-04-30 10:31:54,832 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 16 predicate places. [2025-04-30 10:31:54,832 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 170 transitions, 663 flow [2025-04-30 10:31:54,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 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-04-30 10:31:54,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:54,833 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:31:54,833 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:31:54,833 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:31:54,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1616955913, now seen corresponding path program 1 times [2025-04-30 10:31:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:54,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578410723] [2025-04-30 10:31:54,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:54,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:54,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:31:54,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:31:54,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:54,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:54,845 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:31:54,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:31:54,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:31:54,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:54,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:54,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:31:54,859 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:31:54,860 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2025-04-30 10:31:54,860 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-04-30 10:31:54,860 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-04-30 10:31:54,860 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-04-30 10:31:54,860 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-04-30 10:31:54,860 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-04-30 10:31:54,860 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-04-30 10:31:54,861 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-04-30 10:31:54,861 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-04-30 10:31:54,861 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-04-30 10:31:54,861 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-04-30 10:31:54,861 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-04-30 10:31:54,861 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-04-30 10:31:54,861 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-04-30 10:31:54,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:31:54,861 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:54,915 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-30 10:31:54,915 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:31:54,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:31:54 BasicIcfg [2025-04-30 10:31:54,922 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:31:54,922 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:31:54,923 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:31:54,923 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:31:54,923 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:31:50" (3/4) ... [2025-04-30 10:31:54,924 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:31:54,971 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-04-30 10:31:55,002 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:31:55,004 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:31:55,004 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:31:55,009 INFO L158 Benchmark]: Toolchain (without parser) took 5048.52ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 105.1MB in the beginning and 174.6MB in the end (delta: -69.5MB). Peak memory consumption was 304.9MB. Max. memory is 16.1GB. [2025-04-30 10:31:55,010 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:31:55,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.39ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 83.0MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:31:55,010 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.40ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 80.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:31:55,010 INFO L158 Benchmark]: Boogie Preprocessor took 16.09ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 79.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:31:55,010 INFO L158 Benchmark]: RCFGBuilder took 272.93ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 66.2MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:31:55,011 INFO L158 Benchmark]: TraceAbstraction took 4263.46ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 65.1MB in the beginning and 184.1MB in the end (delta: -119.1MB). Peak memory consumption was 254.6MB. Max. memory is 16.1GB. [2025-04-30 10:31:55,011 INFO L158 Benchmark]: Witness Printer took 81.60ms. Allocated memory is still 520.1MB. Free memory was 184.1MB in the beginning and 174.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:31:55,012 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 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.39ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 83.0MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.40ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 80.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.09ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 79.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 272.93ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 66.2MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4263.46ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 65.1MB in the beginning and 184.1MB in the end (delta: -119.1MB). Peak memory consumption was 254.6MB. Max. memory is 16.1GB. * Witness Printer took 81.60ms. Allocated memory is still 520.1MB. Free memory was 184.1MB in the beginning and 174.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 692]: Data race detected Data race detected The following path leads to a data race: [L685] 0 int threads_alive = 0; VAL [threads_alive=0] [L686] 0 int data = 0; VAL [data=0, threads_alive=0] [L687] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}, threads_alive=0] [L696] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={1:0}, threads_alive=0, threads_total=2] [L697] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\at(cond, Pre)=1, cond=1, data=0, data_mutex={1:0}, threads_alive=0] [L697] RET 0 assume_abort_if_not(threads_total >= 0) [L698] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_alive=0, threads_total=2] [L698] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}, i=0, threads_alive=0, threads_total=2] [L699] 0 threads_alive++ VAL [data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2] [L700] 0 pthread_t tid; VAL [data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2] [L701] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2, tid=-1] [L698] 0 i++ VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L698] COND TRUE 0 i < threads_total VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L699] 0 threads_alive++ VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L690] 1 data = __VERIFIER_nondet_int() VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=1] [L699] 0 threads_alive++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=2, threads_total=2] [L692] 1 threads_alive-- VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=2] [L699] 0 threads_alive++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=2, threads_total=2] [L692] 1 threads_alive-- VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=2] Now there is a data race on ~threads_alive~0 between C: threads_alive++ [699] and C: threads_alive-- [692] - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: 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: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 120 locations, 122 edges, 11 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: 1.4s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 41 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=408occurred in iteration=5, InterpolantAutomatonStates: 21, 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, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 148 locations, 150 edges, 14 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: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 217 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 37 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=663occurred in iteration=6, InterpolantAutomatonStates: 21, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 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-04-30 10:31:55,025 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)