./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-outer-race-4.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-4.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 cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:31:43,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:31:43,713 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:43,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:31:43,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:31:43,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:31:43,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:31:43,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:31:43,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:31:43,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:31:43,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:31:43,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:31:43,739 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:31:43,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:31:43,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:31:43,739 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:31:43,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:31:43,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:31:43,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:31:43,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:31:43,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:31:43,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:31:43,739 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:31:43,739 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:31:43,739 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:31:43,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:31:43,739 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:31:43,739 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:31:43,740 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:31:43,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:31:43,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:31:43,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:31:43,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:31:43,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:31:43,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:31:43,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:31:43,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:31:43,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:31:43,740 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:31:43,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:31:43,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:31:43,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:31:43,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:31:43,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:31:43,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:31:43,741 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 -> cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb [2025-04-30 10:31:43,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:31:43,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:31:43,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:31:43,970 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:31:43,970 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:31:43,972 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-4.i [2025-04-30 10:31:45,226 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c244c2fd/521965bf1c6c49c6939002b3ba0fb723/FLAGd83f85390 [2025-04-30 10:31:45,475 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:31:45,476 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-outer-race-4.i [2025-04-30 10:31:45,487 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c244c2fd/521965bf1c6c49c6939002b3ba0fb723/FLAGd83f85390 [2025-04-30 10:31:46,427 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c244c2fd/521965bf1c6c49c6939002b3ba0fb723 [2025-04-30 10:31:46,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:31:46,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:31:46,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:31:46,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:31:46,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:31:46,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:31:46" (1/1) ... [2025-04-30 10:31:46,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5be736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:46, skipping insertion in model container [2025-04-30 10:31:46,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:31:46" (1/1) ... [2025-04-30 10:31:46,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:31:46,725 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:31:46,750 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:31:46,795 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:31:46,821 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:31:46,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:46 WrapperNode [2025-04-30 10:31:46,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:31:46,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:31:46,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:31:46,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:31:46,826 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:46" (1/1) ... [2025-04-30 10:31:46,836 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:46" (1/1) ... [2025-04-30 10:31:46,854 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-04-30 10:31:46,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:31:46,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:31:46,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:31:46,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:31:46,859 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:46" (1/1) ... [2025-04-30 10:31:46,860 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:46" (1/1) ... [2025-04-30 10:31:46,862 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:46" (1/1) ... [2025-04-30 10:31:46,862 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:46" (1/1) ... [2025-04-30 10:31:46,867 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:46" (1/1) ... [2025-04-30 10:31:46,868 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:46" (1/1) ... [2025-04-30 10:31:46,870 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:46" (1/1) ... [2025-04-30 10:31:46,874 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:46" (1/1) ... [2025-04-30 10:31:46,875 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:46" (1/1) ... [2025-04-30 10:31:46,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:31:46,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:31:46,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:31:46,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:31:46,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:46" (1/1) ... [2025-04-30 10:31:46,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:31:46,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:31:46,909 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:46,914 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:46,926 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:31:46,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:31:46,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:31:46,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-30 10:31:46,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-30 10:31:46,927 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:31:46,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:31:46,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:31:46,928 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:47,021 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:31:47,023 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:31:47,263 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:31:47,263 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:31:47,296 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:31:47,297 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:31:47,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:31:47 BoogieIcfgContainer [2025-04-30 10:31:47,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:31:47,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:31:47,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:31:47,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:31:47,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:31:46" (1/3) ... [2025-04-30 10:31:47,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2607873e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:31:47, skipping insertion in model container [2025-04-30 10:31:47,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:46" (2/3) ... [2025-04-30 10:31:47,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2607873e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:31:47, skipping insertion in model container [2025-04-30 10:31:47,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:31:47" (3/3) ... [2025-04-30 10:31:47,306 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i [2025-04-30 10:31:47,317 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:31:47,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer-race-4.i that has 2 procedures, 228 locations, 230 edges, 1 initial locations, 2 loop locations, and 7 error locations. [2025-04-30 10:31:47,320 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:31:47,378 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:31:47,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 231 transitions, 466 flow [2025-04-30 10:31:47,504 INFO L116 PetriNetUnfolderBase]: 5/272 cut-off events. [2025-04-30 10:31:47,507 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:47,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 272 events. 5/272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 233 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 192. Up to 4 conditions per place. [2025-04-30 10:31:47,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 231 transitions, 466 flow [2025-04-30 10:31:47,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 231 transitions, 466 flow [2025-04-30 10:31:47,523 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:31:47,532 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;@5b5d193a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:31:47,532 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-30 10:31:47,555 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:31:47,555 INFO L116 PetriNetUnfolderBase]: 1/161 cut-off events. [2025-04-30 10:31:47,555 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:47,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:47,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,559 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:47,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:47,564 INFO L85 PathProgramCache]: Analyzing trace with hash -588769515, now seen corresponding path program 1 times [2025-04-30 10:31:47,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:47,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438704708] [2025-04-30 10:31:47,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:47,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:47,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-04-30 10:31:47,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-04-30 10:31:47,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:47,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:47,852 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:47,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:47,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438704708] [2025-04-30 10:31:47,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438704708] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:47,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:47,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:47,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664311742] [2025-04-30 10:31:47,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:47,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:47,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:47,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:47,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:47,904 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 231 [2025-04-30 10:31:47,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 231 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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:47,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:47,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 231 [2025-04-30 10:31:47,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:48,066 INFO L116 PetriNetUnfolderBase]: 98/684 cut-off events. [2025-04-30 10:31:48,066 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:31:48,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 684 events. 98/684 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3162 event pairs, 33 based on Foata normal form. 1/629 useless extension candidates. Maximal degree in co-relation 707. Up to 138 conditions per place. [2025-04-30 10:31:48,073 INFO L140 encePairwiseOnDemand]: 218/231 looper letters, 32 selfloop transitions, 8 changer transitions 1/247 dead transitions. [2025-04-30 10:31:48,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 247 transitions, 578 flow [2025-04-30 10:31:48,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2025-04-30 10:31:48,087 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9624819624819625 [2025-04-30 10:31:48,088 INFO L175 Difference]: Start difference. First operand has 231 places, 231 transitions, 466 flow. Second operand 3 states and 667 transitions. [2025-04-30 10:31:48,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 247 transitions, 578 flow [2025-04-30 10:31:48,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 247 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:31:48,099 INFO L231 Difference]: Finished difference. Result has 235 places, 236 transitions, 530 flow [2025-04-30 10:31:48,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=235, PETRI_TRANSITIONS=236} [2025-04-30 10:31:48,104 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 4 predicate places. [2025-04-30 10:31:48,105 INFO L485 AbstractCegarLoop]: Abstraction has has 235 places, 236 transitions, 530 flow [2025-04-30 10:31:48,105 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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:48,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:48,105 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:31:48,106 INFO L403 AbstractCegarLoop]: === Iteration 2 === 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:48,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:48,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1869749631, now seen corresponding path program 1 times [2025-04-30 10:31:48,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:48,108 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062648666] [2025-04-30 10:31:48,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:48,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:48,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-04-30 10:31:48,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:31:48,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:48,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:48,285 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:48,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:48,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062648666] [2025-04-30 10:31:48,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062648666] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:48,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:48,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:48,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605119515] [2025-04-30 10:31:48,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:48,288 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:48,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:48,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:48,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:48,315 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 231 [2025-04-30 10:31:48,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 236 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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:48,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:48,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 231 [2025-04-30 10:31:48,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:48,421 INFO L116 PetriNetUnfolderBase]: 114/812 cut-off events. [2025-04-30 10:31:48,421 INFO L117 PetriNetUnfolderBase]: For 164/171 co-relation queries the response was YES. [2025-04-30 10:31:48,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 812 events. 114/812 cut-off events. For 164/171 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4197 event pairs, 72 based on Foata normal form. 5/762 useless extension candidates. Maximal degree in co-relation 1025. Up to 226 conditions per place. [2025-04-30 10:31:48,425 INFO L140 encePairwiseOnDemand]: 225/231 looper letters, 29 selfloop transitions, 7 changer transitions 0/245 dead transitions. [2025-04-30 10:31:48,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 245 transitions, 630 flow [2025-04-30 10:31:48,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2025-04-30 10:31:48,427 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9408369408369408 [2025-04-30 10:31:48,427 INFO L175 Difference]: Start difference. First operand has 235 places, 236 transitions, 530 flow. Second operand 3 states and 652 transitions. [2025-04-30 10:31:48,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 245 transitions, 630 flow [2025-04-30 10:31:48,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 245 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:48,433 INFO L231 Difference]: Finished difference. Result has 236 places, 241 transitions, 570 flow [2025-04-30 10:31:48,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=236, PETRI_TRANSITIONS=241} [2025-04-30 10:31:48,435 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 5 predicate places. [2025-04-30 10:31:48,436 INFO L485 AbstractCegarLoop]: Abstraction has has 236 places, 241 transitions, 570 flow [2025-04-30 10:31:48,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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:48,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:48,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,436 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:31:48,436 INFO L403 AbstractCegarLoop]: === Iteration 3 === 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:48,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:48,438 INFO L85 PathProgramCache]: Analyzing trace with hash 799958647, now seen corresponding path program 1 times [2025-04-30 10:31:48,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:48,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807300665] [2025-04-30 10:31:48,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:48,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:48,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-04-30 10:31:48,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-04-30 10:31:48,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:48,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:48,542 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:48,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:48,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807300665] [2025-04-30 10:31:48,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807300665] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:48,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:48,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:48,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573323641] [2025-04-30 10:31:48,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:48,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:48,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:48,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:48,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:48,555 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 231 [2025-04-30 10:31:48,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 241 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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:48,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:48,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 231 [2025-04-30 10:31:48,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:48,663 INFO L116 PetriNetUnfolderBase]: 83/734 cut-off events. [2025-04-30 10:31:48,664 INFO L117 PetriNetUnfolderBase]: For 66/70 co-relation queries the response was YES. [2025-04-30 10:31:48,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 734 events. 83/734 cut-off events. For 66/70 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3715 event pairs, 45 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 838. Up to 114 conditions per place. [2025-04-30 10:31:48,666 INFO L140 encePairwiseOnDemand]: 227/231 looper letters, 17 selfloop transitions, 3 changer transitions 1/247 dead transitions. [2025-04-30 10:31:48,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 624 flow [2025-04-30 10:31:48,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2025-04-30 10:31:48,668 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9581529581529582 [2025-04-30 10:31:48,669 INFO L175 Difference]: Start difference. First operand has 236 places, 241 transitions, 570 flow. Second operand 3 states and 664 transitions. [2025-04-30 10:31:48,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 624 flow [2025-04-30 10:31:48,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:48,673 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 578 flow [2025-04-30 10:31:48,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2025-04-30 10:31:48,674 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 7 predicate places. [2025-04-30 10:31:48,674 INFO L485 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 578 flow [2025-04-30 10:31:48,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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:48,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:48,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:31:48,675 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:48,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:48,675 INFO L85 PathProgramCache]: Analyzing trace with hash 838651774, now seen corresponding path program 1 times [2025-04-30 10:31:48,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:48,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229635662] [2025-04-30 10:31:48,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:48,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:48,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-04-30 10:31:48,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-04-30 10:31:48,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:48,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:48,774 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:48,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:48,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229635662] [2025-04-30 10:31:48,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229635662] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:48,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:48,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:48,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92539787] [2025-04-30 10:31:48,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:48,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:48,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:48,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:48,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:48,784 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2025-04-30 10:31:48,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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:48,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:48,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2025-04-30 10:31:48,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:48,908 INFO L116 PetriNetUnfolderBase]: 92/747 cut-off events. [2025-04-30 10:31:48,908 INFO L117 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2025-04-30 10:31:48,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 747 events. 92/747 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3970 event pairs, 54 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 914. Up to 141 conditions per place. [2025-04-30 10:31:48,912 INFO L140 encePairwiseOnDemand]: 226/231 looper letters, 22 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2025-04-30 10:31:48,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 252 transitions, 654 flow [2025-04-30 10:31:48,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2025-04-30 10:31:48,916 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9567099567099567 [2025-04-30 10:31:48,916 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 578 flow. Second operand 3 states and 663 transitions. [2025-04-30 10:31:48,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 252 transitions, 654 flow [2025-04-30 10:31:48,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 252 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:48,922 INFO L231 Difference]: Finished difference. Result has 240 places, 246 transitions, 608 flow [2025-04-30 10:31:48,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=240, PETRI_TRANSITIONS=246} [2025-04-30 10:31:48,923 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 9 predicate places. [2025-04-30 10:31:48,923 INFO L485 AbstractCegarLoop]: Abstraction has has 240 places, 246 transitions, 608 flow [2025-04-30 10:31:48,924 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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:48,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:48,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,924 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:31:48,924 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:48,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:48,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1494587002, now seen corresponding path program 1 times [2025-04-30 10:31:48,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:48,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036072973] [2025-04-30 10:31:48,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:48,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:48,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-04-30 10:31:48,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-04-30 10:31:48,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:48,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:49,016 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:49,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:49,017 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036072973] [2025-04-30 10:31:49,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036072973] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:49,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:49,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:49,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552615336] [2025-04-30 10:31:49,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:49,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:49,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:49,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:49,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:49,043 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 231 [2025-04-30 10:31:49,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 246 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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:49,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:49,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 231 [2025-04-30 10:31:49,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:49,155 INFO L116 PetriNetUnfolderBase]: 159/927 cut-off events. [2025-04-30 10:31:49,155 INFO L117 PetriNetUnfolderBase]: For 211/217 co-relation queries the response was YES. [2025-04-30 10:31:49,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 927 events. 159/927 cut-off events. For 211/217 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5175 event pairs, 73 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1385. Up to 275 conditions per place. [2025-04-30 10:31:49,159 INFO L140 encePairwiseOnDemand]: 224/231 looper letters, 29 selfloop transitions, 11 changer transitions 4/259 dead transitions. [2025-04-30 10:31:49,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 259 transitions, 730 flow [2025-04-30 10:31:49,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2025-04-30 10:31:49,162 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.950937950937951 [2025-04-30 10:31:49,162 INFO L175 Difference]: Start difference. First operand has 240 places, 246 transitions, 608 flow. Second operand 3 states and 659 transitions. [2025-04-30 10:31:49,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 259 transitions, 730 flow [2025-04-30 10:31:49,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 259 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:49,169 INFO L231 Difference]: Finished difference. Result has 242 places, 250 transitions, 674 flow [2025-04-30 10:31:49,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=242, PETRI_TRANSITIONS=250} [2025-04-30 10:31:49,172 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places. [2025-04-30 10:31:49,172 INFO L485 AbstractCegarLoop]: Abstraction has has 242 places, 250 transitions, 674 flow [2025-04-30 10:31:49,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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:49,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:31:49,173 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:49,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:49,175 INFO L85 PathProgramCache]: Analyzing trace with hash -980302693, now seen corresponding path program 1 times [2025-04-30 10:31:49,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:49,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911883807] [2025-04-30 10:31:49,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:49,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:49,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-04-30 10:31:49,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-04-30 10:31:49,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:49,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:49,412 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:49,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:49,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911883807] [2025-04-30 10:31:49,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911883807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:49,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:49,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:31:49,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173236956] [2025-04-30 10:31:49,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:49,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:31:49,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:49,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:31:49,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:31:49,426 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 231 [2025-04-30 10:31:49,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 250 transitions, 674 flow. Second operand has 5 states, 5 states have (on average 211.4) internal successors, (1057), 5 states have internal predecessors, (1057), 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:49,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:49,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 231 [2025-04-30 10:31:49,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:49,564 INFO L116 PetriNetUnfolderBase]: 142/853 cut-off events. [2025-04-30 10:31:49,564 INFO L117 PetriNetUnfolderBase]: For 276/282 co-relation queries the response was YES. [2025-04-30 10:31:49,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 853 events. 142/853 cut-off events. For 276/282 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4439 event pairs, 39 based on Foata normal form. 2/811 useless extension candidates. Maximal degree in co-relation 1306. Up to 140 conditions per place. [2025-04-30 10:31:49,569 INFO L140 encePairwiseOnDemand]: 224/231 looper letters, 29 selfloop transitions, 7 changer transitions 3/265 dead transitions. [2025-04-30 10:31:49,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 265 transitions, 770 flow [2025-04-30 10:31:49,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:49,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1295 transitions. [2025-04-30 10:31:49,571 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9343434343434344 [2025-04-30 10:31:49,571 INFO L175 Difference]: Start difference. First operand has 242 places, 250 transitions, 674 flow. Second operand 6 states and 1295 transitions. [2025-04-30 10:31:49,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 265 transitions, 770 flow [2025-04-30 10:31:49,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 265 transitions, 734 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-04-30 10:31:49,577 INFO L231 Difference]: Finished difference. Result has 242 places, 251 transitions, 660 flow [2025-04-30 10:31:49,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=660, PETRI_PLACES=242, PETRI_TRANSITIONS=251} [2025-04-30 10:31:49,579 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places. [2025-04-30 10:31:49,579 INFO L485 AbstractCegarLoop]: Abstraction has has 242 places, 251 transitions, 660 flow [2025-04-30 10:31:49,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 211.4) internal successors, (1057), 5 states have internal predecessors, (1057), 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:49,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:49,580 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:31:49,580 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:49,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:49,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1257520556, now seen corresponding path program 1 times [2025-04-30 10:31:49,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:49,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846324695] [2025-04-30 10:31:49,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:49,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:49,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-04-30 10:31:49,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-04-30 10:31:49,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:49,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:49,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:31:49,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-04-30 10:31:49,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-04-30 10:31:49,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:49,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:49,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:31:49,715 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:31:49,716 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-04-30 10:31:49,717 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-04-30 10:31:49,717 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-04-30 10:31:49,717 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-04-30 10:31:49,717 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-04-30 10:31:49,718 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-04-30 10:31:49,718 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-04-30 10:31:49,718 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-04-30 10:31:49,719 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-04-30 10:31:49,719 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-04-30 10:31:49,719 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-04-30 10:31:49,719 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:31:49,719 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:49,722 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:31:49,722 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-30 10:31:49,759 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:31:49,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 261 transitions, 532 flow [2025-04-30 10:31:49,819 INFO L116 PetriNetUnfolderBase]: 7/351 cut-off events. [2025-04-30 10:31:49,819 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:31:49,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 351 events. 7/351 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 401 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 273. Up to 6 conditions per place. [2025-04-30 10:31:49,820 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 261 transitions, 532 flow [2025-04-30 10:31:49,823 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 261 transitions, 532 flow [2025-04-30 10:31:49,824 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:31:49,824 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;@5b5d193a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:31:49,825 INFO L341 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-04-30 10:31:49,833 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:31:49,834 INFO L116 PetriNetUnfolderBase]: 1/161 cut-off events. [2025-04-30 10:31:49,834 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:49,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:49,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,834 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:49,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:49,835 INFO L85 PathProgramCache]: Analyzing trace with hash 733460277, now seen corresponding path program 1 times [2025-04-30 10:31:49,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:49,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611314693] [2025-04-30 10:31:49,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:49,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:49,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-04-30 10:31:49,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-04-30 10:31:49,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:49,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:49,896 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:49,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:49,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611314693] [2025-04-30 10:31:49,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611314693] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:49,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:49,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:49,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417447505] [2025-04-30 10:31:49,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:49,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:49,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:49,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:49,920 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 261 [2025-04-30 10:31:49,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 261 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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:49,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:49,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 261 [2025-04-30 10:31:49,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:50,656 INFO L116 PetriNetUnfolderBase]: 2216/6761 cut-off events. [2025-04-30 10:31:50,656 INFO L117 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-04-30 10:31:50,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 6761 events. 2216/6761 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 63858 event pairs, 879 based on Foata normal form. 1/6057 useless extension candidates. Maximal degree in co-relation 8872. Up to 2089 conditions per place. [2025-04-30 10:31:50,690 INFO L140 encePairwiseOnDemand]: 244/261 looper letters, 46 selfloop transitions, 11 changer transitions 1/285 dead transitions. [2025-04-30 10:31:50,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 285 transitions, 699 flow [2025-04-30 10:31:50,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:50,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2025-04-30 10:31:50,693 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9553001277139208 [2025-04-30 10:31:50,693 INFO L175 Difference]: Start difference. First operand has 263 places, 261 transitions, 532 flow. Second operand 3 states and 748 transitions. [2025-04-30 10:31:50,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 285 transitions, 699 flow [2025-04-30 10:31:50,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 285 transitions, 699 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:31:50,699 INFO L231 Difference]: Finished difference. Result has 267 places, 269 transitions, 622 flow [2025-04-30 10:31:50,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=267, PETRI_TRANSITIONS=269} [2025-04-30 10:31:50,700 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 4 predicate places. [2025-04-30 10:31:50,700 INFO L485 AbstractCegarLoop]: Abstraction has has 267 places, 269 transitions, 622 flow [2025-04-30 10:31:50,700 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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:50,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:50,700 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,700 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:31:50,700 INFO L403 AbstractCegarLoop]: === Iteration 2 === 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:50,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:50,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1457135908, now seen corresponding path program 1 times [2025-04-30 10:31:50,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:50,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958558077] [2025-04-30 10:31:50,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:50,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:50,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-04-30 10:31:50,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:31:50,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:50,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:50,795 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:50,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:50,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958558077] [2025-04-30 10:31:50,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958558077] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:50,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:50,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:50,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266639110] [2025-04-30 10:31:50,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:50,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:50,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:50,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:50,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:50,829 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 261 [2025-04-30 10:31:50,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 269 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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:50,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:50,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 261 [2025-04-30 10:31:50,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:51,810 INFO L116 PetriNetUnfolderBase]: 2480/8562 cut-off events. [2025-04-30 10:31:51,810 INFO L117 PetriNetUnfolderBase]: For 2785/2990 co-relation queries the response was YES. [2025-04-30 10:31:51,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15328 conditions, 8562 events. 2480/8562 cut-off events. For 2785/2990 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 87943 event pairs, 1597 based on Foata normal form. 70/7873 useless extension candidates. Maximal degree in co-relation 13171. Up to 3442 conditions per place. [2025-04-30 10:31:51,859 INFO L140 encePairwiseOnDemand]: 253/261 looper letters, 42 selfloop transitions, 12 changer transitions 0/287 dead transitions. [2025-04-30 10:31:51,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 287 transitions, 790 flow [2025-04-30 10:31:51,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2025-04-30 10:31:51,862 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9374201787994891 [2025-04-30 10:31:51,862 INFO L175 Difference]: Start difference. First operand has 267 places, 269 transitions, 622 flow. Second operand 3 states and 734 transitions. [2025-04-30 10:31:51,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 287 transitions, 790 flow [2025-04-30 10:31:51,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:51,871 INFO L231 Difference]: Finished difference. Result has 268 places, 279 transitions, 706 flow [2025-04-30 10:31:51,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=268, PETRI_TRANSITIONS=279} [2025-04-30 10:31:51,873 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 5 predicate places. [2025-04-30 10:31:51,873 INFO L485 AbstractCegarLoop]: Abstraction has has 268 places, 279 transitions, 706 flow [2025-04-30 10:31:51,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:51,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,874 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:31:51,874 INFO L403 AbstractCegarLoop]: === Iteration 3 === 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:51,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:51,875 INFO L85 PathProgramCache]: Analyzing trace with hash 893835383, now seen corresponding path program 1 times [2025-04-30 10:31:51,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:51,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116455861] [2025-04-30 10:31:51,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:51,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:51,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-04-30 10:31:51,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-04-30 10:31:51,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:51,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:51,931 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,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:51,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116455861] [2025-04-30 10:31:51,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116455861] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:51,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:51,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:51,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876921696] [2025-04-30 10:31:51,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:51,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:51,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:51,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:51,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:51,942 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 261 [2025-04-30 10:31:51,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 279 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:51,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 261 [2025-04-30 10:31:51,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:52,768 INFO L116 PetriNetUnfolderBase]: 1878/7688 cut-off events. [2025-04-30 10:31:52,768 INFO L117 PetriNetUnfolderBase]: For 1102/1919 co-relation queries the response was YES. [2025-04-30 10:31:52,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12618 conditions, 7688 events. 1878/7688 cut-off events. For 1102/1919 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 82596 event pairs, 1092 based on Foata normal form. 7/6759 useless extension candidates. Maximal degree in co-relation 10919. Up to 1725 conditions per place. [2025-04-30 10:31:52,835 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 28 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2025-04-30 10:31:52,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 290 transitions, 792 flow [2025-04-30 10:31:52,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2025-04-30 10:31:52,837 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9540229885057471 [2025-04-30 10:31:52,837 INFO L175 Difference]: Start difference. First operand has 268 places, 279 transitions, 706 flow. Second operand 3 states and 747 transitions. [2025-04-30 10:31:52,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 290 transitions, 792 flow [2025-04-30 10:31:52,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 290 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:52,845 INFO L231 Difference]: Finished difference. Result has 270 places, 282 transitions, 712 flow [2025-04-30 10:31:52,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=270, PETRI_TRANSITIONS=282} [2025-04-30 10:31:52,846 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 7 predicate places. [2025-04-30 10:31:52,846 INFO L485 AbstractCegarLoop]: Abstraction has has 270 places, 282 transitions, 712 flow [2025-04-30 10:31:52,846 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:52,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:31:52,847 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:52,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:52,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2049600006, now seen corresponding path program 1 times [2025-04-30 10:31:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:52,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96197366] [2025-04-30 10:31:52,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:52,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:52,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-04-30 10:31:52,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-04-30 10:31:52,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:52,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:52,899 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,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:52,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96197366] [2025-04-30 10:31:52,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96197366] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:52,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:52,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:52,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284631663] [2025-04-30 10:31:52,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:52,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:52,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:52,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:52,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:52,912 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 261 [2025-04-30 10:31:52,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 282 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:52,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 261 [2025-04-30 10:31:52,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:53,927 INFO L116 PetriNetUnfolderBase]: 2430/9836 cut-off events. [2025-04-30 10:31:53,927 INFO L117 PetriNetUnfolderBase]: For 1611/2578 co-relation queries the response was YES. [2025-04-30 10:31:53,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16531 conditions, 9836 events. 2430/9836 cut-off events. For 1611/2578 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 113088 event pairs, 1418 based on Foata normal form. 11/8675 useless extension candidates. Maximal degree in co-relation 14739. Up to 2447 conditions per place. [2025-04-30 10:31:53,984 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 34 selfloop transitions, 7 changer transitions 0/298 dead transitions. [2025-04-30 10:31:53,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 298 transitions, 841 flow [2025-04-30 10:31:53,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2025-04-30 10:31:53,986 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9540229885057471 [2025-04-30 10:31:53,987 INFO L175 Difference]: Start difference. First operand has 270 places, 282 transitions, 712 flow. Second operand 3 states and 747 transitions. [2025-04-30 10:31:53,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 298 transitions, 841 flow [2025-04-30 10:31:53,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 298 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:53,997 INFO L231 Difference]: Finished difference. Result has 272 places, 287 transitions, 760 flow [2025-04-30 10:31:53,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=272, PETRI_TRANSITIONS=287} [2025-04-30 10:31:54,001 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 9 predicate places. [2025-04-30 10:31:54,001 INFO L485 AbstractCegarLoop]: Abstraction has has 272 places, 287 transitions, 760 flow [2025-04-30 10:31:54,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:54,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,001 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:31:54,001 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:54,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:54,002 INFO L85 PathProgramCache]: Analyzing trace with hash 479224782, now seen corresponding path program 1 times [2025-04-30 10:31:54,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:54,002 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974891486] [2025-04-30 10:31:54,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:54,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:54,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-04-30 10:31:54,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-04-30 10:31:54,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:54,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:54,073 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,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:54,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974891486] [2025-04-30 10:31:54,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974891486] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:54,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:54,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:54,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409419515] [2025-04-30 10:31:54,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:54,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:54,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:54,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:54,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:54,104 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 261 [2025-04-30 10:31:54,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 287 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:54,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 261 [2025-04-30 10:31:54,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:54,955 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L713-5-->L712-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][267], [281#true, 200#L712-1true, 262#true, 221#L695-2true, 286#true, 159#L695-6true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 264#true, Black: 278#(= |#race~data~0| 0), Black: 266#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)]) [2025-04-30 10:31:54,956 INFO L286 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-04-30 10:31:54,956 INFO L289 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-04-30 10:31:54,956 INFO L289 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-04-30 10:31:54,956 INFO L289 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-04-30 10:31:55,019 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L713-5-->L712-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][170], [281#true, 200#L712-1true, 262#true, 39#L697true, 221#L695-2true, 286#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 264#true, Black: 278#(= |#race~data~0| 0), Black: 266#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)]) [2025-04-30 10:31:55,019 INFO L286 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-04-30 10:31:55,019 INFO L289 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-04-30 10:31:55,019 INFO L289 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-04-30 10:31:55,019 INFO L289 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-04-30 10:31:55,050 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L713-5-->L712-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][170], [281#true, 260#L697-3true, 200#L712-1true, 262#true, 221#L695-2true, 286#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 264#true, Black: 278#(= |#race~data~0| 0), Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-04-30 10:31:55,050 INFO L286 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-04-30 10:31:55,050 INFO L289 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-04-30 10:31:55,050 INFO L289 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-04-30 10:31:55,050 INFO L289 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-04-30 10:31:55,284 INFO L116 PetriNetUnfolderBase]: 4089/13244 cut-off events. [2025-04-30 10:31:55,284 INFO L117 PetriNetUnfolderBase]: For 5637/5987 co-relation queries the response was YES. [2025-04-30 10:31:55,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25628 conditions, 13244 events. 4089/13244 cut-off events. For 5637/5987 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 146369 event pairs, 2075 based on Foata normal form. 79/11927 useless extension candidates. Maximal degree in co-relation 21564. Up to 5204 conditions per place. [2025-04-30 10:31:55,340 INFO L140 encePairwiseOnDemand]: 252/261 looper letters, 49 selfloop transitions, 19 changer transitions 0/313 dead transitions. [2025-04-30 10:31:55,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 313 transitions, 997 flow [2025-04-30 10:31:55,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2025-04-30 10:31:55,342 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9476372924648787 [2025-04-30 10:31:55,342 INFO L175 Difference]: Start difference. First operand has 272 places, 287 transitions, 760 flow. Second operand 3 states and 742 transitions. [2025-04-30 10:31:55,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 313 transitions, 997 flow [2025-04-30 10:31:55,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 313 transitions, 983 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:55,348 INFO L231 Difference]: Finished difference. Result has 274 places, 302 transitions, 928 flow [2025-04-30 10:31:55,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=274, PETRI_TRANSITIONS=302} [2025-04-30 10:31:55,349 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2025-04-30 10:31:55,349 INFO L485 AbstractCegarLoop]: Abstraction has has 274 places, 302 transitions, 928 flow [2025-04-30 10:31:55,350 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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:55,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:55,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:31:55,350 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:55,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:55,351 INFO L85 PathProgramCache]: Analyzing trace with hash 776884931, now seen corresponding path program 1 times [2025-04-30 10:31:55,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:55,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719479325] [2025-04-30 10:31:55,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:55,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:55,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-04-30 10:31:55,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-04-30 10:31:55,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:55,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:55,483 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:55,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:55,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719479325] [2025-04-30 10:31:55,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719479325] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:55,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:55,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:31:55,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908319124] [2025-04-30 10:31:55,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:55,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:31:55,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:55,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:31:55,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:31:55,502 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 261 [2025-04-30 10:31:55,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 302 transitions, 928 flow. Second operand has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 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:55,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:55,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 261 [2025-04-30 10:31:55,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:56,441 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L713-5-->L712-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][274], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 200#L712-1true, 291#true, 262#true, 221#L695-2true, 286#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 159#L695-6true, 264#true, Black: 278#(= |#race~data~0| 0), Black: 266#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)]) [2025-04-30 10:31:56,442 INFO L286 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-04-30 10:31:56,442 INFO L289 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-04-30 10:31:56,442 INFO L289 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-04-30 10:31:56,442 INFO L289 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-04-30 10:31:56,469 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L705-5-->L705-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| |v_#race~threads_alive~0_4|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][273], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 61#L705-6true, 291#true, 262#true, 221#L695-2true, 286#true, Black: 271#true, Black: 268#(= |#race~threads_alive~0| 0), 159#L695-6true, Black: 278#(= |#race~data~0| 0), 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)]) [2025-04-30 10:31:56,469 INFO L286 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-04-30 10:31:56,469 INFO L289 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-04-30 10:31:56,469 INFO L289 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-04-30 10:31:56,469 INFO L289 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-04-30 10:31:56,489 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([764] L713-5-->L712-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][274], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 200#L712-1true, 291#true, 262#true, 221#L695-2true, 286#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 159#L695-6true, 264#true, Black: 278#(= |#race~data~0| 0), Black: 266#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)]) [2025-04-30 10:31:56,490 INFO L286 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-04-30 10:31:56,490 INFO L289 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-04-30 10:31:56,490 INFO L289 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-04-30 10:31:56,490 INFO L289 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-04-30 10:31:56,490 INFO L289 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-04-30 10:31:56,495 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([764] L713-5-->L712-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][274], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 200#L712-1true, 291#true, 262#true, 221#L695-2true, 286#true, 159#L695-6true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 278#(= |#race~data~0| 0), 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-04-30 10:31:56,495 INFO L286 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-04-30 10:31:56,495 INFO L289 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-04-30 10:31:56,495 INFO L289 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-04-30 10:31:56,495 INFO L289 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-04-30 10:31:56,495 INFO L289 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-04-30 10:31:56,495 INFO L289 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-04-30 10:31:56,536 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L713-5-->L712-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][216], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 200#L712-1true, 291#true, 262#true, 39#L697true, 221#L695-2true, 286#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 264#true, Black: 278#(= |#race~data~0| 0), Black: 266#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)]) [2025-04-30 10:31:56,537 INFO L286 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-04-30 10:31:56,537 INFO L289 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-04-30 10:31:56,537 INFO L289 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-04-30 10:31:56,537 INFO L289 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-04-30 10:31:56,544 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L713-5-->L712-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][274], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 200#L712-1true, 291#true, 262#true, 286#true, 159#L695-6true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 264#true, Black: 278#(= |#race~data~0| 0), Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true, 197#L695-1true]) [2025-04-30 10:31:56,544 INFO L286 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-04-30 10:31:56,544 INFO L289 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-04-30 10:31:56,544 INFO L289 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-04-30 10:31:56,544 INFO L289 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-04-30 10:31:56,627 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([764] L713-5-->L712-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][216], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 200#L712-1true, 291#true, 262#true, 39#L697true, 221#L695-2true, 286#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 278#(= |#race~data~0| 0), 264#true, Black: 266#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)]) [2025-04-30 10:31:56,627 INFO L286 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-04-30 10:31:56,628 INFO L289 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-04-30 10:31:56,628 INFO L289 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-04-30 10:31:56,628 INFO L289 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-04-30 10:31:56,628 INFO L289 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-04-30 10:31:56,636 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L713-5-->L712-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][216], [146#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 200#L712-1true, 291#true, 262#true, 221#L695-2true, 286#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 278#(= |#race~data~0| 0), 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-04-30 10:31:56,637 INFO L286 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-04-30 10:31:56,637 INFO L289 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-04-30 10:31:56,637 INFO L289 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-04-30 10:31:56,637 INFO L289 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-04-30 10:31:56,676 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L713-5-->L712-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][216], [260#L697-3true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 200#L712-1true, 291#true, 262#true, 221#L695-2true, 286#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 264#true, Black: 278#(= |#race~data~0| 0), Black: 266#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)]) [2025-04-30 10:31:56,676 INFO L286 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-04-30 10:31:56,676 INFO L289 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-04-30 10:31:56,676 INFO L289 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-04-30 10:31:56,676 INFO L289 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-04-30 10:31:56,686 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([828] L695-2-->L695-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2)) InVars {~threads_alive~0=v_~threads_alive~0_7} OutVars{~threads_alive~0=v_~threads_alive~0_6} AuxVars[] AssignedVars[~threads_alive~0][290], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 291#true, 262#true, 28#L695-3true, 286#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 218#L695-3true, Black: 278#(= |#race~data~0| 0), 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 237#L706-3true, Black: 266#true]) [2025-04-30 10:31:56,686 INFO L286 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-04-30 10:31:56,686 INFO L289 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-04-30 10:31:56,686 INFO L289 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-04-30 10:31:56,686 INFO L289 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-04-30 10:31:56,725 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([801] L695-4-->L695-5: Formula: (= |v_#race~threads_alive~0_11| |v_threadThread1of2ForFork0_#t~nondet5_3|) InVars {threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|} OutVars{threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|, #race~threads_alive~0=|v_#race~threads_alive~0_11|} AuxVars[] AssignedVars[#race~threads_alive~0][222], [30#L695-5true, 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 291#true, 262#true, 233#L706true, 221#L695-2true, Black: 268#(= |#race~threads_alive~0| 0), Black: 286#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 278#(= |#race~data~0| 0), 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)]) [2025-04-30 10:31:56,725 INFO L286 olderBase$Statistics]: this new event has 252 ancestors and is not cut-off event [2025-04-30 10:31:56,725 INFO L289 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2025-04-30 10:31:56,725 INFO L289 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2025-04-30 10:31:56,725 INFO L289 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2025-04-30 10:31:57,044 INFO L116 PetriNetUnfolderBase]: 4737/15801 cut-off events. [2025-04-30 10:31:57,044 INFO L117 PetriNetUnfolderBase]: For 6858/7545 co-relation queries the response was YES. [2025-04-30 10:31:57,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31067 conditions, 15801 events. 4737/15801 cut-off events. For 6858/7545 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 185056 event pairs, 1712 based on Foata normal form. 71/14047 useless extension candidates. Maximal degree in co-relation 16596. Up to 4209 conditions per place. [2025-04-30 10:31:57,144 INFO L140 encePairwiseOnDemand]: 253/261 looper letters, 45 selfloop transitions, 9 changer transitions 2/332 dead transitions. [2025-04-30 10:31:57,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 332 transitions, 1100 flow [2025-04-30 10:31:57,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:57,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2025-04-30 10:31:57,152 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.929757343550447 [2025-04-30 10:31:57,152 INFO L175 Difference]: Start difference. First operand has 274 places, 302 transitions, 928 flow. Second operand 6 states and 1456 transitions. [2025-04-30 10:31:57,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 332 transitions, 1100 flow [2025-04-30 10:31:57,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 332 transitions, 1062 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:57,187 INFO L231 Difference]: Finished difference. Result has 279 places, 309 transitions, 941 flow [2025-04-30 10:31:57,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=279, PETRI_TRANSITIONS=309} [2025-04-30 10:31:57,187 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 16 predicate places. [2025-04-30 10:31:57,187 INFO L485 AbstractCegarLoop]: Abstraction has has 279 places, 309 transitions, 941 flow [2025-04-30 10:31:57,188 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 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:57,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:57,193 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,194 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:31:57,194 INFO L403 AbstractCegarLoop]: === Iteration 7 === 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:57,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:57,195 INFO L85 PathProgramCache]: Analyzing trace with hash -688948549, now seen corresponding path program 1 times [2025-04-30 10:31:57,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:57,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522757846] [2025-04-30 10:31:57,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:57,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:57,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-04-30 10:31:57,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-04-30 10:31:57,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:57,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:57,677 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:57,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:57,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522757846] [2025-04-30 10:31:57,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522757846] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:57,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:57,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:31:57,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75911545] [2025-04-30 10:31:57,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:57,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:31:57,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:57,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:31:57,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:31:57,735 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 261 [2025-04-30 10:31:57,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 309 transitions, 941 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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:57,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:57,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 261 [2025-04-30 10:31:57,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:58,055 INFO L116 PetriNetUnfolderBase]: 321/2651 cut-off events. [2025-04-30 10:31:58,055 INFO L117 PetriNetUnfolderBase]: For 665/701 co-relation queries the response was YES. [2025-04-30 10:31:58,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4680 conditions, 2651 events. 321/2651 cut-off events. For 665/701 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 22686 event pairs, 119 based on Foata normal form. 86/2586 useless extension candidates. Maximal degree in co-relation 4104. Up to 283 conditions per place. [2025-04-30 10:31:58,066 INFO L140 encePairwiseOnDemand]: 249/261 looper letters, 11 selfloop transitions, 12 changer transitions 0/275 dead transitions. [2025-04-30 10:31:58,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 275 transitions, 762 flow [2025-04-30 10:31:58,067 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:31:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:31:58,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1233 transitions. [2025-04-30 10:31:58,069 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9448275862068966 [2025-04-30 10:31:58,069 INFO L175 Difference]: Start difference. First operand has 279 places, 309 transitions, 941 flow. Second operand 5 states and 1233 transitions. [2025-04-30 10:31:58,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 275 transitions, 762 flow [2025-04-30 10:31:58,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 275 transitions, 716 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-04-30 10:31:58,076 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 679 flow [2025-04-30 10:31:58,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=679, PETRI_PLACES=273, PETRI_TRANSITIONS=270} [2025-04-30 10:31:58,076 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 10 predicate places. [2025-04-30 10:31:58,076 INFO L485 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 679 flow [2025-04-30 10:31:58,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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:58,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:58,077 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,077 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:31:58,078 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:31:58,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:58,078 INFO L85 PathProgramCache]: Analyzing trace with hash 654296306, now seen corresponding path program 1 times [2025-04-30 10:31:58,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:58,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857683946] [2025-04-30 10:31:58,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:58,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:58,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-04-30 10:31:58,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-04-30 10:31:58,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:58,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:58,139 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:58,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:58,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857683946] [2025-04-30 10:31:58,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857683946] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:58,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:58,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:58,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358824459] [2025-04-30 10:31:58,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:58,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:58,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:58,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:58,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:58,151 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 261 [2025-04-30 10:31:58,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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:58,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:58,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 261 [2025-04-30 10:31:58,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:58,537 INFO L116 PetriNetUnfolderBase]: 1083/4561 cut-off events. [2025-04-30 10:31:58,537 INFO L117 PetriNetUnfolderBase]: For 1582/1594 co-relation queries the response was YES. [2025-04-30 10:31:58,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8766 conditions, 4561 events. 1083/4561 cut-off events. For 1582/1594 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 43961 event pairs, 573 based on Foata normal form. 0/4268 useless extension candidates. Maximal degree in co-relation 8187. Up to 1492 conditions per place. [2025-04-30 10:31:58,558 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 34 selfloop transitions, 10 changer transitions 0/286 dead transitions. [2025-04-30 10:31:58,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 286 transitions, 831 flow [2025-04-30 10:31:58,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2025-04-30 10:31:58,560 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9527458492975734 [2025-04-30 10:31:58,560 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 679 flow. Second operand 3 states and 746 transitions. [2025-04-30 10:31:58,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 286 transitions, 831 flow [2025-04-30 10:31:58,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 286 transitions, 810 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:31:58,565 INFO L231 Difference]: Finished difference. Result has 274 places, 276 transitions, 748 flow [2025-04-30 10:31:58,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=274, PETRI_TRANSITIONS=276} [2025-04-30 10:31:58,567 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2025-04-30 10:31:58,567 INFO L485 AbstractCegarLoop]: Abstraction has has 274 places, 276 transitions, 748 flow [2025-04-30 10:31:58,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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:58,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:58,567 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:31:58,568 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:31:58,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:58,569 INFO L85 PathProgramCache]: Analyzing trace with hash 62187179, now seen corresponding path program 1 times [2025-04-30 10:31:58,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:58,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141934767] [2025-04-30 10:31:58,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:58,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:58,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-04-30 10:31:58,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-04-30 10:31:58,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:58,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:58,700 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:58,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:58,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141934767] [2025-04-30 10:31:58,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141934767] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:58,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:58,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:31:58,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276019370] [2025-04-30 10:31:58,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:58,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:58,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:58,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:58,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:58,712 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 261 [2025-04-30 10:31:58,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 276 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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:58,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:58,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 261 [2025-04-30 10:31:58,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:59,117 INFO L116 PetriNetUnfolderBase]: 646/4598 cut-off events. [2025-04-30 10:31:59,117 INFO L117 PetriNetUnfolderBase]: For 1800/1953 co-relation queries the response was YES. [2025-04-30 10:31:59,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8372 conditions, 4598 events. 646/4598 cut-off events. For 1800/1953 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 48715 event pairs, 112 based on Foata normal form. 15/4399 useless extension candidates. Maximal degree in co-relation 7189. Up to 698 conditions per place. [2025-04-30 10:31:59,137 INFO L140 encePairwiseOnDemand]: 252/261 looper letters, 21 selfloop transitions, 9 changer transitions 0/289 dead transitions. [2025-04-30 10:31:59,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 289 transitions, 849 flow [2025-04-30 10:31:59,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2025-04-30 10:31:59,138 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9680715197956578 [2025-04-30 10:31:59,138 INFO L175 Difference]: Start difference. First operand has 274 places, 276 transitions, 748 flow. Second operand 3 states and 758 transitions. [2025-04-30 10:31:59,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 289 transitions, 849 flow [2025-04-30 10:31:59,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 289 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:59,144 INFO L231 Difference]: Finished difference. Result has 275 places, 283 transitions, 788 flow [2025-04-30 10:31:59,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=275, PETRI_TRANSITIONS=283} [2025-04-30 10:31:59,145 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 12 predicate places. [2025-04-30 10:31:59,145 INFO L485 AbstractCegarLoop]: Abstraction has has 275 places, 283 transitions, 788 flow [2025-04-30 10:31:59,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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:59,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:59,146 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,146 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:31:59,146 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:31:59,147 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:59,147 INFO L85 PathProgramCache]: Analyzing trace with hash -854270631, now seen corresponding path program 2 times [2025-04-30 10:31:59,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:59,147 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589099925] [2025-04-30 10:31:59,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:31:59,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:59,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 1 equivalence classes. [2025-04-30 10:31:59,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-04-30 10:31:59,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:31:59,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:59,334 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:59,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:59,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589099925] [2025-04-30 10:31:59,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589099925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:59,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:59,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:31:59,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16633606] [2025-04-30 10:31:59,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:59,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:31:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:59,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:31:59,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:31:59,373 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 261 [2025-04-30 10:31:59,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 283 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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:59,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:59,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 261 [2025-04-30 10:31:59,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:59,612 INFO L116 PetriNetUnfolderBase]: 302/2783 cut-off events. [2025-04-30 10:31:59,612 INFO L117 PetriNetUnfolderBase]: For 983/1176 co-relation queries the response was YES. [2025-04-30 10:31:59,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5096 conditions, 2783 events. 302/2783 cut-off events. For 983/1176 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 24971 event pairs, 83 based on Foata normal form. 61/2744 useless extension candidates. Maximal degree in co-relation 4430. Up to 326 conditions per place. [2025-04-30 10:31:59,623 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 28 selfloop transitions, 8 changer transitions 0/289 dead transitions. [2025-04-30 10:31:59,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 289 transitions, 867 flow [2025-04-30 10:31:59,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:31:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:31:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1236 transitions. [2025-04-30 10:31:59,625 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9471264367816092 [2025-04-30 10:31:59,625 INFO L175 Difference]: Start difference. First operand has 275 places, 283 transitions, 788 flow. Second operand 5 states and 1236 transitions. [2025-04-30 10:31:59,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 289 transitions, 867 flow [2025-04-30 10:31:59,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 289 transitions, 854 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-30 10:31:59,631 INFO L231 Difference]: Finished difference. Result has 278 places, 278 transitions, 751 flow [2025-04-30 10:31:59,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=751, PETRI_PLACES=278, PETRI_TRANSITIONS=278} [2025-04-30 10:31:59,631 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 15 predicate places. [2025-04-30 10:31:59,632 INFO L485 AbstractCegarLoop]: Abstraction has has 278 places, 278 transitions, 751 flow [2025-04-30 10:31:59,632 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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:59,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:59,632 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,632 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:31:59,632 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:31:59,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:59,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1305262714, now seen corresponding path program 1 times [2025-04-30 10:31:59,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:59,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982734583] [2025-04-30 10:31:59,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:59,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:59,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-04-30 10:31:59,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-04-30 10:31:59,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:59,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:59,681 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:59,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:59,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982734583] [2025-04-30 10:31:59,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982734583] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:59,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:59,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:59,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013967915] [2025-04-30 10:31:59,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:59,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:59,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:59,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:59,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:59,712 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 261 [2025-04-30 10:31:59,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 278 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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:59,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:59,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 261 [2025-04-30 10:31:59,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:00,031 INFO L116 PetriNetUnfolderBase]: 503/3564 cut-off events. [2025-04-30 10:32:00,031 INFO L117 PetriNetUnfolderBase]: For 2156/2398 co-relation queries the response was YES. [2025-04-30 10:32:00,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7138 conditions, 3564 events. 503/3564 cut-off events. For 2156/2398 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 34452 event pairs, 226 based on Foata normal form. 6/3415 useless extension candidates. Maximal degree in co-relation 6345. Up to 891 conditions per place. [2025-04-30 10:32:00,041 INFO L140 encePairwiseOnDemand]: 258/261 looper letters, 37 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-04-30 10:32:00,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 280 transitions, 845 flow [2025-04-30 10:32:00,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:00,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2025-04-30 10:32:00,042 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2025-04-30 10:32:00,042 INFO L175 Difference]: Start difference. First operand has 278 places, 278 transitions, 751 flow. Second operand 3 states and 725 transitions. [2025-04-30 10:32:00,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 280 transitions, 845 flow [2025-04-30 10:32:00,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 280 transitions, 833 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:32:00,046 INFO L231 Difference]: Finished difference. Result has 276 places, 277 transitions, 744 flow [2025-04-30 10:32:00,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=276, PETRI_TRANSITIONS=277} [2025-04-30 10:32:00,046 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 13 predicate places. [2025-04-30 10:32:00,047 INFO L485 AbstractCegarLoop]: Abstraction has has 276 places, 277 transitions, 744 flow [2025-04-30 10:32:00,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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:32:00,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:00,047 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:00,047 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:32:00,047 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:32:00,048 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1238471515, now seen corresponding path program 1 times [2025-04-30 10:32:00,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:00,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358103106] [2025-04-30 10:32:00,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:00,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:00,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-04-30 10:32:00,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-04-30 10:32:00,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:00,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:00,171 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:32:00,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:00,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358103106] [2025-04-30 10:32:00,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358103106] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:00,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:00,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:32:00,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339667753] [2025-04-30 10:32:00,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:00,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:32:00,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:00,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:32:00,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:32:00,182 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 261 [2025-04-30 10:32:00,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 277 transitions, 744 flow. Second operand has 7 states, 7 states have (on average 235.57142857142858) internal successors, (1649), 7 states have internal predecessors, (1649), 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:32:00,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:00,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 261 [2025-04-30 10:32:00,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:00,495 INFO L116 PetriNetUnfolderBase]: 323/2280 cut-off events. [2025-04-30 10:32:00,495 INFO L117 PetriNetUnfolderBase]: For 1004/1067 co-relation queries the response was YES. [2025-04-30 10:32:00,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4455 conditions, 2280 events. 323/2280 cut-off events. For 1004/1067 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 17584 event pairs, 78 based on Foata normal form. 22/2223 useless extension candidates. Maximal degree in co-relation 3225. Up to 288 conditions per place. [2025-04-30 10:32:00,504 INFO L140 encePairwiseOnDemand]: 254/261 looper letters, 70 selfloop transitions, 14 changer transitions 12/329 dead transitions. [2025-04-30 10:32:00,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 329 transitions, 1153 flow [2025-04-30 10:32:00,504 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:32:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:32:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2174 transitions. [2025-04-30 10:32:00,506 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9255002128565347 [2025-04-30 10:32:00,506 INFO L175 Difference]: Start difference. First operand has 276 places, 277 transitions, 744 flow. Second operand 9 states and 2174 transitions. [2025-04-30 10:32:00,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 329 transitions, 1153 flow [2025-04-30 10:32:00,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 329 transitions, 1149 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:32:00,511 INFO L231 Difference]: Finished difference. Result has 284 places, 278 transitions, 787 flow [2025-04-30 10:32:00,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=787, PETRI_PLACES=284, PETRI_TRANSITIONS=278} [2025-04-30 10:32:00,512 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 21 predicate places. [2025-04-30 10:32:00,512 INFO L485 AbstractCegarLoop]: Abstraction has has 284 places, 278 transitions, 787 flow [2025-04-30 10:32:00,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 235.57142857142858) internal successors, (1649), 7 states have internal predecessors, (1649), 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:32:00,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:00,513 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:00,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:32:00,513 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:32:00,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:00,513 INFO L85 PathProgramCache]: Analyzing trace with hash -912301016, now seen corresponding path program 1 times [2025-04-30 10:32:00,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:00,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858138112] [2025-04-30 10:32:00,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:00,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:00,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-04-30 10:32:00,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-04-30 10:32:00,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:00,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:32:00,537 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:32:00,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-04-30 10:32:00,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-04-30 10:32:00,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:00,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:32:00,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:32:00,571 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:32:00,571 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-04-30 10:32:00,571 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-04-30 10:32:00,571 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-04-30 10:32:00,571 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-04-30 10:32:00,571 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-04-30 10:32:00,571 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-04-30 10:32:00,571 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-04-30 10:32:00,571 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-04-30 10:32:00,572 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-04-30 10:32:00,572 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-04-30 10:32:00,572 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-04-30 10:32:00,572 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-04-30 10:32:00,572 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-04-30 10:32:00,573 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-04-30 10:32:00,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:32:00,573 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:32:00,573 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:32:00,573 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-30 10:32:00,600 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:32:00,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 295 places, 291 transitions, 600 flow [2025-04-30 10:32:00,633 INFO L116 PetriNetUnfolderBase]: 9/430 cut-off events. [2025-04-30 10:32:00,633 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-30 10:32:00,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 430 events. 9/430 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 571 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 355. Up to 8 conditions per place. [2025-04-30 10:32:00,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 291 transitions, 600 flow [2025-04-30 10:32:00,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 291 transitions, 600 flow [2025-04-30 10:32:00,638 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:32:00,638 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;@5b5d193a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:32:00,638 INFO L341 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-04-30 10:32:00,643 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:32:00,643 INFO L116 PetriNetUnfolderBase]: 1/161 cut-off events. [2025-04-30 10:32:00,643 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:32:00,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:00,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:00,644 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:32:00,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:00,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1170954261, now seen corresponding path program 1 times [2025-04-30 10:32:00,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:00,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053532835] [2025-04-30 10:32:00,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:00,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:00,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-04-30 10:32:00,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-04-30 10:32:00,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:00,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:00,681 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:32:00,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:00,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053532835] [2025-04-30 10:32:00,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053532835] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:00,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:00,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:32:00,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800659641] [2025-04-30 10:32:00,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:00,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:00,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:00,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:00,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:00,706 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 291 [2025-04-30 10:32:00,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 291 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 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:32:00,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:00,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 291 [2025-04-30 10:32:00,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:08,367 INFO L116 PetriNetUnfolderBase]: 35239/79075 cut-off events. [2025-04-30 10:32:08,368 INFO L117 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2025-04-30 10:32:08,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129887 conditions, 79075 events. 35239/79075 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 2945. Compared 957099 event pairs, 14941 based on Foata normal form. 1/71001 useless extension candidates. Maximal degree in co-relation 109153. Up to 27933 conditions per place. [2025-04-30 10:32:08,827 INFO L140 encePairwiseOnDemand]: 270/291 looper letters, 60 selfloop transitions, 14 changer transitions 1/323 dead transitions. [2025-04-30 10:32:08,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 323 transitions, 824 flow [2025-04-30 10:32:08,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 829 transitions. [2025-04-30 10:32:08,829 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9495990836197021 [2025-04-30 10:32:08,829 INFO L175 Difference]: Start difference. First operand has 295 places, 291 transitions, 600 flow. Second operand 3 states and 829 transitions. [2025-04-30 10:32:08,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 323 transitions, 824 flow [2025-04-30 10:32:08,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 323 transitions, 820 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-04-30 10:32:08,834 INFO L231 Difference]: Finished difference. Result has 299 places, 302 transitions, 714 flow [2025-04-30 10:32:08,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=299, PETRI_TRANSITIONS=302} [2025-04-30 10:32:08,834 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, 4 predicate places. [2025-04-30 10:32:08,835 INFO L485 AbstractCegarLoop]: Abstraction has has 299 places, 302 transitions, 714 flow [2025-04-30 10:32:08,835 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 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:32:08,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:08,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:08,835 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:32:08,835 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:32:08,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:08,836 INFO L85 PathProgramCache]: Analyzing trace with hash 651523239, now seen corresponding path program 1 times [2025-04-30 10:32:08,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:08,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980178509] [2025-04-30 10:32:08,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:08,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:08,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-04-30 10:32:08,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:32:08,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:08,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:08,871 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:32:08,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:08,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980178509] [2025-04-30 10:32:08,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980178509] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:08,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:08,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:32:08,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925860815] [2025-04-30 10:32:08,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:08,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:08,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:08,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:08,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:08,906 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 291 [2025-04-30 10:32:08,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 302 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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:32:08,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:08,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 291 [2025-04-30 10:32:08,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:12,364 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [292#true, 303#true, 35#L691-3true, Black: 298#true, 294#true, 79#L695-1true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true]) [2025-04-30 10:32:12,364 INFO L286 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-04-30 10:32:12,364 INFO L289 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-04-30 10:32:12,364 INFO L289 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-04-30 10:32:12,364 INFO L289 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-04-30 10:32:12,365 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [292#true, 303#true, 35#L691-3true, 294#true, 221#L695-2true, Black: 298#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true]) [2025-04-30 10:32:12,365 INFO L286 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-04-30 10:32:12,365 INFO L289 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-04-30 10:32:12,365 INFO L289 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-04-30 10:32:12,365 INFO L289 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-04-30 10:32:12,365 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [303#true, 292#true, Black: 298#true, 35#L691-3true, 221#L695-2true, 294#true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true]) [2025-04-30 10:32:12,365 INFO L286 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-04-30 10:32:12,365 INFO L289 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-04-30 10:32:12,365 INFO L289 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-04-30 10:32:12,365 INFO L289 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-04-30 10:32:12,551 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->L712-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][170], [303#true, 292#true, Black: 298#true, 35#L691-3true, 79#L695-1true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true]) [2025-04-30 10:32:12,551 INFO L286 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-04-30 10:32:12,551 INFO L289 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-04-30 10:32:12,551 INFO L289 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-04-30 10:32:12,551 INFO L289 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-04-30 10:32:12,551 INFO L289 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-04-30 10:32:12,552 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->L712-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][170], [303#true, 292#true, Black: 298#true, 35#L691-3true, 221#L695-2true, 294#true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true]) [2025-04-30 10:32:12,552 INFO L286 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-04-30 10:32:12,552 INFO L289 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-04-30 10:32:12,552 INFO L289 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-04-30 10:32:12,552 INFO L289 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-04-30 10:32:12,552 INFO L289 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-04-30 10:32:12,758 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->L712-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][170], [292#true, 303#true, 35#L691-3true, Black: 298#true, 294#true, 221#L695-2true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true]) [2025-04-30 10:32:12,759 INFO L286 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-04-30 10:32:12,759 INFO L289 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-04-30 10:32:12,759 INFO L289 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-04-30 10:32:12,759 INFO L289 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-04-30 10:32:12,759 INFO L289 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-04-30 10:32:12,759 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [303#true, 292#true, Black: 298#true, 294#true, 35#L691-3true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2025-04-30 10:32:12,759 INFO L286 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-04-30 10:32:12,759 INFO L289 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-04-30 10:32:12,759 INFO L289 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-04-30 10:32:12,759 INFO L289 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-04-30 10:32:13,648 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][157], [292#true, 303#true, 294#true, Black: 298#true, 35#L691-3true, 103#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2025-04-30 10:32:13,649 INFO L286 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2025-04-30 10:32:13,649 INFO L289 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-04-30 10:32:13,649 INFO L289 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-04-30 10:32:13,649 INFO L289 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-04-30 10:32:13,650 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][157], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 292#true, 303#true, 35#L691-3true, Black: 298#true, 294#true, 300#(= |#race~threads_alive~0| 0), 45#L695-5true, 296#true, 219#L712-1true]) [2025-04-30 10:32:13,650 INFO L286 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2025-04-30 10:32:13,650 INFO L289 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-04-30 10:32:13,650 INFO L289 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-04-30 10:32:13,650 INFO L289 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-04-30 10:32:14,478 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][157], [292#true, 303#true, 294#true, Black: 298#true, 35#L691-3true, 300#(= |#race~threads_alive~0| 0), 296#true, 245#L697-3true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2025-04-30 10:32:14,478 INFO L286 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2025-04-30 10:32:14,478 INFO L289 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2025-04-30 10:32:14,478 INFO L289 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-04-30 10:32:14,478 INFO L289 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2025-04-30 10:32:14,480 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][157], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 303#true, 292#true, Black: 298#true, 35#L691-3true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true]) [2025-04-30 10:32:14,480 INFO L286 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2025-04-30 10:32:14,480 INFO L289 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2025-04-30 10:32:14,480 INFO L289 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-04-30 10:32:14,480 INFO L289 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2025-04-30 10:32:14,935 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [156#L693-3true, 292#true, 303#true, 294#true, 79#L695-1true, Black: 298#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true]) [2025-04-30 10:32:14,935 INFO L286 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-04-30 10:32:14,935 INFO L289 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-04-30 10:32:14,935 INFO L289 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-04-30 10:32:14,935 INFO L289 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-04-30 10:32:14,935 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [156#L693-3true, 303#true, 292#true, Black: 298#true, 294#true, 221#L695-2true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true]) [2025-04-30 10:32:14,935 INFO L286 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-04-30 10:32:14,935 INFO L289 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-04-30 10:32:14,936 INFO L289 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-04-30 10:32:14,936 INFO L289 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-04-30 10:32:14,936 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [156#L693-3true, 303#true, 292#true, Black: 298#true, 221#L695-2true, 294#true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true]) [2025-04-30 10:32:14,936 INFO L286 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-04-30 10:32:14,936 INFO L289 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-04-30 10:32:14,936 INFO L289 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-04-30 10:32:14,936 INFO L289 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-04-30 10:32:15,210 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->L712-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][170], [156#L693-3true, 292#true, 303#true, 79#L695-1true, Black: 298#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true]) [2025-04-30 10:32:15,210 INFO L286 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-04-30 10:32:15,210 INFO L289 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-04-30 10:32:15,210 INFO L289 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-04-30 10:32:15,210 INFO L289 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-04-30 10:32:15,210 INFO L289 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-04-30 10:32:15,212 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->L712-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][170], [156#L693-3true, 303#true, 292#true, Black: 298#true, 221#L695-2true, 294#true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true]) [2025-04-30 10:32:15,212 INFO L286 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-04-30 10:32:15,212 INFO L289 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-04-30 10:32:15,212 INFO L289 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-04-30 10:32:15,212 INFO L289 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-04-30 10:32:15,212 INFO L289 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-04-30 10:32:15,495 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->L712-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][170], [156#L693-3true, 292#true, 303#true, 221#L695-2true, Black: 298#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true]) [2025-04-30 10:32:15,495 INFO L286 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-04-30 10:32:15,495 INFO L289 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-04-30 10:32:15,495 INFO L289 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-04-30 10:32:15,495 INFO L289 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-04-30 10:32:15,495 INFO L289 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-04-30 10:32:15,496 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [156#L693-3true, 292#true, 303#true, 294#true, Black: 298#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2025-04-30 10:32:15,496 INFO L286 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-04-30 10:32:15,496 INFO L289 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-04-30 10:32:15,496 INFO L289 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-04-30 10:32:15,496 INFO L289 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-04-30 10:32:15,498 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [303#true, 292#true, Black: 298#true, 294#true, 79#L695-1true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true, 261#L694-3true]) [2025-04-30 10:32:15,498 INFO L286 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-04-30 10:32:15,498 INFO L289 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-04-30 10:32:15,498 INFO L289 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-04-30 10:32:15,498 INFO L289 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-04-30 10:32:15,498 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [292#true, 303#true, Black: 298#true, 294#true, 221#L695-2true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true, 261#L694-3true]) [2025-04-30 10:32:15,498 INFO L286 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-04-30 10:32:15,498 INFO L289 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-04-30 10:32:15,498 INFO L289 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-04-30 10:32:15,499 INFO L289 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-04-30 10:32:15,499 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [292#true, 303#true, Black: 298#true, 221#L695-2true, 294#true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, 261#L694-3true]) [2025-04-30 10:32:15,499 INFO L286 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-04-30 10:32:15,499 INFO L289 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-04-30 10:32:15,499 INFO L289 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-04-30 10:32:15,499 INFO L289 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-04-30 10:32:15,770 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->L712-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][170], [292#true, 303#true, Black: 298#true, 79#L695-1true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, 261#L694-3true]) [2025-04-30 10:32:15,770 INFO L286 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-04-30 10:32:15,770 INFO L289 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-04-30 10:32:15,770 INFO L289 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-04-30 10:32:15,770 INFO L289 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-04-30 10:32:15,770 INFO L289 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-04-30 10:32:15,772 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->L712-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][170], [292#true, 303#true, 221#L695-2true, 294#true, Black: 298#true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, 261#L694-3true]) [2025-04-30 10:32:15,772 INFO L286 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-04-30 10:32:15,772 INFO L289 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-04-30 10:32:15,772 INFO L289 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-04-30 10:32:15,772 INFO L289 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-04-30 10:32:15,772 INFO L289 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-04-30 10:32:16,080 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->L712-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][170], [292#true, 303#true, 221#L695-2true, Black: 298#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, 261#L694-3true]) [2025-04-30 10:32:16,080 INFO L286 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-04-30 10:32:16,080 INFO L289 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-04-30 10:32:16,080 INFO L289 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-04-30 10:32:16,080 INFO L289 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-04-30 10:32:16,081 INFO L289 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-04-30 10:32:16,081 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [303#true, 292#true, 294#true, Black: 298#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 261#L694-3true]) [2025-04-30 10:32:16,081 INFO L286 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-04-30 10:32:16,081 INFO L289 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-04-30 10:32:16,081 INFO L289 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-04-30 10:32:16,081 INFO L289 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-04-30 10:32:16,395 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][157], [156#L693-3true, 303#true, 292#true, Black: 298#true, 294#true, 300#(= |#race~threads_alive~0| 0), 103#L695-5true, 296#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2025-04-30 10:32:16,395 INFO L286 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2025-04-30 10:32:16,395 INFO L289 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-04-30 10:32:16,395 INFO L289 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-04-30 10:32:16,395 INFO L289 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-04-30 10:32:16,398 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][157], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 156#L693-3true, 292#true, 303#true, Black: 298#true, 294#true, 300#(= |#race~threads_alive~0| 0), 45#L695-5true, 296#true, 219#L712-1true]) [2025-04-30 10:32:16,398 INFO L286 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2025-04-30 10:32:16,398 INFO L289 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-04-30 10:32:16,398 INFO L289 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-04-30 10:32:16,398 INFO L289 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-04-30 10:32:17,178 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][157], [292#true, 303#true, 294#true, Black: 298#true, 103#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 261#L694-3true]) [2025-04-30 10:32:17,178 INFO L286 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2025-04-30 10:32:17,178 INFO L289 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-04-30 10:32:17,178 INFO L289 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-04-30 10:32:17,178 INFO L289 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-04-30 10:32:17,181 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][157], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 292#true, 303#true, Black: 298#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 45#L695-5true, 219#L712-1true, 261#L694-3true]) [2025-04-30 10:32:17,181 INFO L286 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2025-04-30 10:32:17,181 INFO L289 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-04-30 10:32:17,182 INFO L289 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-04-30 10:32:17,182 INFO L289 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-04-30 10:32:17,380 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][157], [156#L693-3true, 292#true, 303#true, 294#true, Black: 298#true, 300#(= |#race~threads_alive~0| 0), 296#true, 245#L697-3true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2025-04-30 10:32:17,380 INFO L286 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2025-04-30 10:32:17,380 INFO L289 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-04-30 10:32:17,380 INFO L289 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-04-30 10:32:17,380 INFO L289 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-04-30 10:32:17,383 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][157], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 156#L693-3true, 292#true, 303#true, Black: 298#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true]) [2025-04-30 10:32:17,383 INFO L286 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2025-04-30 10:32:17,383 INFO L289 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-04-30 10:32:17,383 INFO L289 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-04-30 10:32:17,383 INFO L289 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-04-30 10:32:17,770 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][157], [292#true, 303#true, Black: 298#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 245#L697-3true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 261#L694-3true]) [2025-04-30 10:32:17,770 INFO L286 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2025-04-30 10:32:17,770 INFO L289 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-04-30 10:32:17,770 INFO L289 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-04-30 10:32:17,770 INFO L289 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-04-30 10:32:17,773 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][157], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 292#true, 303#true, Black: 298#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, 261#L694-3true]) [2025-04-30 10:32:17,773 INFO L286 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2025-04-30 10:32:17,773 INFO L289 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-04-30 10:32:17,774 INFO L289 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-04-30 10:32:17,774 INFO L289 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-04-30 10:32:18,938 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][157], [124#L697-3true, 303#true, 292#true, Black: 298#true, 157#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 294#true, 300#(= |#race~threads_alive~0| 0), 245#L697-3true, 296#true, 219#L712-1true]) [2025-04-30 10:32:18,938 INFO L286 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2025-04-30 10:32:18,938 INFO L289 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-04-30 10:32:18,938 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:32:18,938 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:32:18,939 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][157], [292#true, 303#true, Black: 298#true, 294#true, 300#(= |#race~threads_alive~0| 0), 245#L697-3true, 296#true, 219#L712-1true, 272#L697-3true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2025-04-30 10:32:18,939 INFO L286 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2025-04-30 10:32:18,939 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:32:18,939 INFO L289 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-04-30 10:32:18,939 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:32:18,940 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][157], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 303#true, 292#true, Black: 298#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, 272#L697-3true]) [2025-04-30 10:32:18,941 INFO L286 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2025-04-30 10:32:18,941 INFO L289 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-04-30 10:32:18,941 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:32:18,941 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:32:19,265 INFO L116 PetriNetUnfolderBase]: 38618/99725 cut-off events. [2025-04-30 10:32:19,266 INFO L117 PetriNetUnfolderBase]: For 39477/43473 co-relation queries the response was YES. [2025-04-30 10:32:19,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192268 conditions, 99725 events. 38618/99725 cut-off events. For 39477/43473 co-relation queries the response was YES. Maximal size of possible extension queue 3188. Compared 1333220 event pairs, 24930 based on Foata normal form. 654/90669 useless extension candidates. Maximal degree in co-relation 190021. Up to 46398 conditions per place. [2025-04-30 10:32:19,784 INFO L140 encePairwiseOnDemand]: 281/291 looper letters, 55 selfloop transitions, 16 changer transitions 0/328 dead transitions. [2025-04-30 10:32:19,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 328 transitions, 944 flow [2025-04-30 10:32:19,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2025-04-30 10:32:19,786 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9347079037800687 [2025-04-30 10:32:19,786 INFO L175 Difference]: Start difference. First operand has 299 places, 302 transitions, 714 flow. Second operand 3 states and 816 transitions. [2025-04-30 10:32:19,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 328 transitions, 944 flow [2025-04-30 10:32:19,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 328 transitions, 904 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:32:19,906 INFO L231 Difference]: Finished difference. Result has 300 places, 316 transitions, 832 flow [2025-04-30 10:32:19,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=300, PETRI_TRANSITIONS=316} [2025-04-30 10:32:19,906 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, 5 predicate places. [2025-04-30 10:32:19,906 INFO L485 AbstractCegarLoop]: Abstraction has has 300 places, 316 transitions, 832 flow [2025-04-30 10:32:19,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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:32:19,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:19,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:19,907 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:32:19,907 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:32:19,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:19,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1689646711, now seen corresponding path program 1 times [2025-04-30 10:32:19,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:19,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651626862] [2025-04-30 10:32:19,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:19,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:19,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-04-30 10:32:19,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-04-30 10:32:19,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:19,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:19,936 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:32:19,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:19,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651626862] [2025-04-30 10:32:19,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651626862] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:19,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:19,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:32:19,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749054166] [2025-04-30 10:32:19,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:19,937 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:19,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:19,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:19,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:19,947 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 291 [2025-04-30 10:32:19,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 316 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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:32:19,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:19,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 291 [2025-04-30 10:32:19,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:22,997 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [308#true, 303#true, 292#true, Black: 298#true, 79#L695-1true, 294#true, 238#L695-2true, 187#$Ultimate##0true, 296#true, 219#L712-1true, Black: 305#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2025-04-30 10:32:22,998 INFO L286 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2025-04-30 10:32:22,998 INFO L289 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-04-30 10:32:22,998 INFO L289 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-04-30 10:32:22,998 INFO L289 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-04-30 10:32:22,998 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [308#true, 303#true, 292#true, Black: 298#true, 221#L695-2true, 294#true, 135#L695-1true, 187#$Ultimate##0true, 296#true, 219#L712-1true, Black: 305#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2025-04-30 10:32:22,998 INFO L286 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2025-04-30 10:32:22,998 INFO L289 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-04-30 10:32:22,998 INFO L289 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-04-30 10:32:22,998 INFO L289 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-04-30 10:32:23,299 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [308#true, 303#true, 292#true, 221#L695-2true, 294#true, Black: 298#true, 238#L695-2true, 187#$Ultimate##0true, 296#true, 219#L712-1true, Black: 305#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2025-04-30 10:32:23,299 INFO L286 olderBase$Statistics]: this new event has 274 ancestors and is cut-off event [2025-04-30 10:32:23,299 INFO L289 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-04-30 10:32:23,299 INFO L289 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-04-30 10:32:23,299 INFO L289 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-04-30 10:32:28,948 INFO L116 PetriNetUnfolderBase]: 30650/91597 cut-off events. [2025-04-30 10:32:28,948 INFO L117 PetriNetUnfolderBase]: For 15704/48849 co-relation queries the response was YES. [2025-04-30 10:32:29,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158995 conditions, 91597 events. 30650/91597 cut-off events. For 15704/48849 co-relation queries the response was YES. Maximal size of possible extension queue 3191. Compared 1318518 event pairs, 18292 based on Foata normal form. 49/78852 useless extension candidates. Maximal degree in co-relation 157149. Up to 23313 conditions per place. [2025-04-30 10:32:29,484 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 38 selfloop transitions, 5 changer transitions 0/332 dead transitions. [2025-04-30 10:32:29,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 332 transitions, 950 flow [2025-04-30 10:32:29,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 830 transitions. [2025-04-30 10:32:29,485 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9507445589919816 [2025-04-30 10:32:29,485 INFO L175 Difference]: Start difference. First operand has 300 places, 316 transitions, 832 flow. Second operand 3 states and 830 transitions. [2025-04-30 10:32:29,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 332 transitions, 950 flow [2025-04-30 10:32:29,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 332 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:32:29,820 INFO L231 Difference]: Finished difference. Result has 302 places, 320 transitions, 838 flow [2025-04-30 10:32:29,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=302, PETRI_TRANSITIONS=320} [2025-04-30 10:32:29,821 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, 7 predicate places. [2025-04-30 10:32:29,821 INFO L485 AbstractCegarLoop]: Abstraction has has 302 places, 320 transitions, 838 flow [2025-04-30 10:32:29,821 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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:32:29,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:29,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:29,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:32:29,821 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:32:29,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:29,821 INFO L85 PathProgramCache]: Analyzing trace with hash 179641830, now seen corresponding path program 1 times [2025-04-30 10:32:29,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:29,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963462194] [2025-04-30 10:32:29,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:29,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:29,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-04-30 10:32:29,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-04-30 10:32:29,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:29,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:29,853 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:32:29,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:29,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963462194] [2025-04-30 10:32:29,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963462194] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:29,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:29,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:32:29,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93565368] [2025-04-30 10:32:29,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:29,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:29,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:29,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:29,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:29,865 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 291 [2025-04-30 10:32:29,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 320 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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:32:29,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:29,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 291 [2025-04-30 10:32:29,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:34,406 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [308#true, 292#true, 79#L695-1true, 294#true, Black: 298#true, 238#L695-2true, 187#$Ultimate##0true, 296#true, 313#true, 219#L712-1true, Black: 305#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 310#(= |#race~data~0| 0)]) [2025-04-30 10:32:34,406 INFO L286 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2025-04-30 10:32:34,406 INFO L289 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-04-30 10:32:34,406 INFO L289 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-04-30 10:32:34,406 INFO L289 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-04-30 10:32:34,407 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [308#true, 292#true, 221#L695-2true, Black: 298#true, 294#true, 135#L695-1true, 187#$Ultimate##0true, 296#true, 313#true, 219#L712-1true, Black: 305#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 310#(= |#race~data~0| 0)]) [2025-04-30 10:32:34,407 INFO L286 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2025-04-30 10:32:34,407 INFO L289 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-04-30 10:32:34,407 INFO L289 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-04-30 10:32:34,407 INFO L289 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-04-30 10:32:34,642 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->L712-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][170], [308#true, 292#true, Black: 298#true, 294#true, 221#L695-2true, 238#L695-2true, 187#$Ultimate##0true, 296#true, 313#true, 219#L712-1true, Black: 305#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 310#(= |#race~data~0| 0)]) [2025-04-30 10:32:34,642 INFO L286 olderBase$Statistics]: this new event has 274 ancestors and is cut-off event [2025-04-30 10:32:34,642 INFO L289 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-04-30 10:32:34,642 INFO L289 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-04-30 10:32:34,642 INFO L289 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event