./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.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 2775f713e378913186e8b7d26aeab9962af0cc62e93b6360bbda34aa29f8c3e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:51:08,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:51:08,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:51:08,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:51:08,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:51:08,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:51:08,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:51:08,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:51:08,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:51:08,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:51:08,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:51:08,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:51:08,844 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:51:08,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:51:08,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:51:08,844 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:51:08,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:51:08,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:51:08,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:51:08,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:51:08,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:51:08,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:51:08,844 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:51:08,844 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:51:08,844 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:51:08,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:51:08,844 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:51:08,846 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:51:08,846 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:51:08,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:51:08,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:51:08,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:51:08,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:51:08,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:51:08,846 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:51:08,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:51:08,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:51:08,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:51:08,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:51:08,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:51:08,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:51:08,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:51:08,847 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 -> 2775f713e378913186e8b7d26aeab9962af0cc62e93b6360bbda34aa29f8c3e8 [2025-03-14 01:51:09,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:51:09,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:51:09,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:51:09,071 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:51:09,072 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:51:09,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i [2025-03-14 01:51:10,197 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bb8b767b/6c8b075bf8624e9db32c00387b3ae435/FLAGbf3eaa6ae [2025-03-14 01:51:10,497 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:51:10,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i [2025-03-14 01:51:10,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bb8b767b/6c8b075bf8624e9db32c00387b3ae435/FLAGbf3eaa6ae [2025-03-14 01:51:10,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bb8b767b/6c8b075bf8624e9db32c00387b3ae435 [2025-03-14 01:51:10,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:51:10,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:51:10,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:51:10,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:51:10,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:51:10,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:51:10" (1/1) ... [2025-03-14 01:51:10,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74781be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:10, skipping insertion in model container [2025-03-14 01:51:10,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:51:10" (1/1) ... [2025-03-14 01:51:10,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:51:10,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:51:10,847 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:51:10,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:51:10,928 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:51:10,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:10 WrapperNode [2025-03-14 01:51:10,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:51:10,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:51:10,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:51:10,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:51:10,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:10" (1/1) ... [2025-03-14 01:51:10,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:10" (1/1) ... [2025-03-14 01:51:10,967 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-03-14 01:51:10,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:51:10,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:51:10,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:51:10,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:51:10,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:10" (1/1) ... [2025-03-14 01:51:10,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:10" (1/1) ... [2025-03-14 01:51:10,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:10" (1/1) ... [2025-03-14 01:51:10,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:10" (1/1) ... [2025-03-14 01:51:10,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:10" (1/1) ... [2025-03-14 01:51:10,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:10" (1/1) ... [2025-03-14 01:51:10,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:10" (1/1) ... [2025-03-14 01:51:10,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:10" (1/1) ... [2025-03-14 01:51:10,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:51:10,999 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:51:10,999 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:51:10,999 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:51:11,000 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:10" (1/1) ... [2025-03-14 01:51:11,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:51:11,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:51:11,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:51:11,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:51:11,047 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:51:11,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:51:11,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:51:11,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-14 01:51:11,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-14 01:51:11,048 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:51:11,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:51:11,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:51:11,049 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:51:11,183 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:51:11,185 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:51:11,461 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:51:11,462 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:51:11,462 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:51:11,516 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:51:11,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:51:11 BoogieIcfgContainer [2025-03-14 01:51:11,516 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:51:11,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:51:11,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:51:11,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:51:11,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:51:10" (1/3) ... [2025-03-14 01:51:11,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dff191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:51:11, skipping insertion in model container [2025-03-14 01:51:11,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:10" (2/3) ... [2025-03-14 01:51:11,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dff191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:51:11, skipping insertion in model container [2025-03-14 01:51:11,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:51:11" (3/3) ... [2025-03-14 01:51:11,524 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer.i [2025-03-14 01:51:11,536 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:51:11,538 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer.i that has 2 procedures, 230 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-14 01:51:11,539 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:51:11,597 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:51:11,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 233 transitions, 470 flow [2025-03-14 01:51:11,749 INFO L124 PetriNetUnfolderBase]: 5/274 cut-off events. [2025-03-14 01:51:11,751 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:51:11,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 274 events. 5/274 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 239 event pairs, 0 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 192. Up to 4 conditions per place. [2025-03-14 01:51:11,756 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 233 transitions, 470 flow [2025-03-14 01:51:11,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 233 transitions, 470 flow [2025-03-14 01:51:11,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:51:11,777 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3638f38e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:51:11,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-14 01:51:11,810 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:51:11,812 INFO L124 PetriNetUnfolderBase]: 1/160 cut-off events. [2025-03-14 01:51:11,812 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:51:11,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:11,814 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-03-14 01:51:11,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:51:11,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:11,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1104275436, now seen corresponding path program 1 times [2025-03-14 01:51:11,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:11,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49742719] [2025-03-14 01:51:11,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:11,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:11,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-14 01:51:11,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-14 01:51:11,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:11,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:12,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:12,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49742719] [2025-03-14 01:51:12,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49742719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:12,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:12,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:12,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58516808] [2025-03-14 01:51:12,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:12,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:12,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:12,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:12,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:12,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 233 [2025-03-14 01:51:12,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 233 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:12,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:12,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 233 [2025-03-14 01:51:12,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:12,414 INFO L124 PetriNetUnfolderBase]: 98/708 cut-off events. [2025-03-14 01:51:12,414 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:51:12,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 708 events. 98/708 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3362 event pairs, 33 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 731. Up to 138 conditions per place. [2025-03-14 01:51:12,420 INFO L140 encePairwiseOnDemand]: 220/233 looper letters, 32 selfloop transitions, 8 changer transitions 1/249 dead transitions. [2025-03-14 01:51:12,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 249 transitions, 582 flow [2025-03-14 01:51:12,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2025-03-14 01:51:12,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9628040057224606 [2025-03-14 01:51:12,435 INFO L175 Difference]: Start difference. First operand has 233 places, 233 transitions, 470 flow. Second operand 3 states and 673 transitions. [2025-03-14 01:51:12,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 249 transitions, 582 flow [2025-03-14 01:51:12,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 249 transitions, 582 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:12,446 INFO L231 Difference]: Finished difference. Result has 237 places, 238 transitions, 534 flow [2025-03-14 01:51:12,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=237, PETRI_TRANSITIONS=238} [2025-03-14 01:51:12,452 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 4 predicate places. [2025-03-14 01:51:12,452 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 238 transitions, 534 flow [2025-03-14 01:51:12,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:12,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:12,453 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-03-14 01:51:12,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:51:12,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:51:12,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash 316198158, now seen corresponding path program 1 times [2025-03-14 01:51:12,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:12,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496200865] [2025-03-14 01:51:12,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:12,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:12,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-14 01:51:12,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-14 01:51:12,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:12,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:12,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:12,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496200865] [2025-03-14 01:51:12,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496200865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:12,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:12,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:12,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365254704] [2025-03-14 01:51:12,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:12,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:12,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:12,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:12,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:12,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 233 [2025-03-14 01:51:12,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 238 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:12,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:12,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 233 [2025-03-14 01:51:12,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:12,780 INFO L124 PetriNetUnfolderBase]: 114/845 cut-off events. [2025-03-14 01:51:12,780 INFO L125 PetriNetUnfolderBase]: For 164/169 co-relation queries the response was YES. [2025-03-14 01:51:12,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 845 events. 114/845 cut-off events. For 164/169 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4478 event pairs, 72 based on Foata normal form. 4/793 useless extension candidates. Maximal degree in co-relation 1058. Up to 226 conditions per place. [2025-03-14 01:51:12,787 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 29 selfloop transitions, 7 changer transitions 0/247 dead transitions. [2025-03-14 01:51:12,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 634 flow [2025-03-14 01:51:12,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2025-03-14 01:51:12,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413447782546495 [2025-03-14 01:51:12,789 INFO L175 Difference]: Start difference. First operand has 237 places, 238 transitions, 534 flow. Second operand 3 states and 658 transitions. [2025-03-14 01:51:12,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 634 flow [2025-03-14 01:51:12,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:12,795 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 574 flow [2025-03-14 01:51:12,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2025-03-14 01:51:12,796 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 5 predicate places. [2025-03-14 01:51:12,796 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 574 flow [2025-03-14 01:51:12,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:12,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:12,796 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-03-14 01:51:12,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:51:12,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:51:12,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:12,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1896165239, now seen corresponding path program 1 times [2025-03-14 01:51:12,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:12,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137603003] [2025-03-14 01:51:12,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:12,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:12,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-14 01:51:12,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-14 01:51:12,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:12,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:12,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:12,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137603003] [2025-03-14 01:51:12,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137603003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:12,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:12,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:12,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141473558] [2025-03-14 01:51:12,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:12,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:12,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:12,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:12,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:12,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 233 [2025-03-14 01:51:12,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:12,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:12,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 233 [2025-03-14 01:51:12,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:13,056 INFO L124 PetriNetUnfolderBase]: 83/766 cut-off events. [2025-03-14 01:51:13,057 INFO L125 PetriNetUnfolderBase]: For 65/69 co-relation queries the response was YES. [2025-03-14 01:51:13,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 766 events. 83/766 cut-off events. For 65/69 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3983 event pairs, 45 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 870. Up to 114 conditions per place. [2025-03-14 01:51:13,060 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 17 selfloop transitions, 3 changer transitions 1/249 dead transitions. [2025-03-14 01:51:13,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 249 transitions, 628 flow [2025-03-14 01:51:13,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2025-03-14 01:51:13,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585121602288984 [2025-03-14 01:51:13,062 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 574 flow. Second operand 3 states and 670 transitions. [2025-03-14 01:51:13,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 249 transitions, 628 flow [2025-03-14 01:51:13,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 249 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:13,068 INFO L231 Difference]: Finished difference. Result has 240 places, 245 transitions, 582 flow [2025-03-14 01:51:13,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=240, PETRI_TRANSITIONS=245} [2025-03-14 01:51:13,069 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 7 predicate places. [2025-03-14 01:51:13,069 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 245 transitions, 582 flow [2025-03-14 01:51:13,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:13,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:13,070 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-03-14 01:51:13,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:51:13,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:51:13,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:13,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1425040558, now seen corresponding path program 1 times [2025-03-14 01:51:13,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:13,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168016960] [2025-03-14 01:51:13,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:13,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:13,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-14 01:51:13,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-14 01:51:13,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:13,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:13,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:13,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168016960] [2025-03-14 01:51:13,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168016960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:13,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:13,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:13,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335670058] [2025-03-14 01:51:13,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:13,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:13,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:13,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:13,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:13,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 233 [2025-03-14 01:51:13,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 245 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:13,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:13,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 233 [2025-03-14 01:51:13,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:13,343 INFO L124 PetriNetUnfolderBase]: 92/781 cut-off events. [2025-03-14 01:51:13,343 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2025-03-14 01:51:13,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 781 events. 92/781 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4191 event pairs, 54 based on Foata normal form. 0/734 useless extension candidates. Maximal degree in co-relation 942. Up to 141 conditions per place. [2025-03-14 01:51:13,346 INFO L140 encePairwiseOnDemand]: 228/233 looper letters, 22 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2025-03-14 01:51:13,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 254 transitions, 658 flow [2025-03-14 01:51:13,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2025-03-14 01:51:13,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570815450643777 [2025-03-14 01:51:13,348 INFO L175 Difference]: Start difference. First operand has 240 places, 245 transitions, 582 flow. Second operand 3 states and 669 transitions. [2025-03-14 01:51:13,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 254 transitions, 658 flow [2025-03-14 01:51:13,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 254 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:13,352 INFO L231 Difference]: Finished difference. Result has 242 places, 248 transitions, 612 flow [2025-03-14 01:51:13,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=242, PETRI_TRANSITIONS=248} [2025-03-14 01:51:13,353 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 9 predicate places. [2025-03-14 01:51:13,353 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 248 transitions, 612 flow [2025-03-14 01:51:13,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:13,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:13,354 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] [2025-03-14 01:51:13,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:51:13,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:51:13,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:13,355 INFO L85 PathProgramCache]: Analyzing trace with hash -252734310, now seen corresponding path program 1 times [2025-03-14 01:51:13,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:13,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170087145] [2025-03-14 01:51:13,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:13,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:13,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-14 01:51:13,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-14 01:51:13,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:13,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:13,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:13,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170087145] [2025-03-14 01:51:13,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170087145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:13,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:13,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:13,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054311947] [2025-03-14 01:51:13,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:13,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:13,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:13,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:13,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:13,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 233 [2025-03-14 01:51:13,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 248 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:13,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:13,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 233 [2025-03-14 01:51:13,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:13,606 INFO L124 PetriNetUnfolderBase]: 159/965 cut-off events. [2025-03-14 01:51:13,606 INFO L125 PetriNetUnfolderBase]: For 209/216 co-relation queries the response was YES. [2025-03-14 01:51:13,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 965 events. 159/965 cut-off events. For 209/216 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5537 event pairs, 73 based on Foata normal form. 1/922 useless extension candidates. Maximal degree in co-relation 1423. Up to 275 conditions per place. [2025-03-14 01:51:13,609 INFO L140 encePairwiseOnDemand]: 226/233 looper letters, 29 selfloop transitions, 11 changer transitions 4/261 dead transitions. [2025-03-14 01:51:13,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 261 transitions, 734 flow [2025-03-14 01:51:13,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2025-03-14 01:51:13,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513590844062947 [2025-03-14 01:51:13,612 INFO L175 Difference]: Start difference. First operand has 242 places, 248 transitions, 612 flow. Second operand 3 states and 665 transitions. [2025-03-14 01:51:13,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 261 transitions, 734 flow [2025-03-14 01:51:13,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 261 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:13,616 INFO L231 Difference]: Finished difference. Result has 244 places, 252 transitions, 678 flow [2025-03-14 01:51:13,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=244, PETRI_TRANSITIONS=252} [2025-03-14 01:51:13,617 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 11 predicate places. [2025-03-14 01:51:13,617 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 252 transitions, 678 flow [2025-03-14 01:51:13,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:13,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:13,618 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-03-14 01:51:13,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:51:13,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:51:13,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:13,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1610865144, now seen corresponding path program 1 times [2025-03-14 01:51:13,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:13,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163612387] [2025-03-14 01:51:13,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:13,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:13,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-14 01:51:13,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-14 01:51:13,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:13,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:51:13,652 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:51:13,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-14 01:51:13,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-14 01:51:13,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:13,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:51:13,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:51:13,738 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:51:13,739 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-14 01:51:13,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-14 01:51:13,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-14 01:51:13,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-14 01:51:13,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-14 01:51:13,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-14 01:51:13,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-14 01:51:13,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-14 01:51:13,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-14 01:51:13,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-14 01:51:13,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-14 01:51:13,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:51:13,741 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-14 01:51:13,743 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:51:13,743 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:51:13,766 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:51:13,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 265 transitions, 540 flow [2025-03-14 01:51:13,796 INFO L124 PetriNetUnfolderBase]: 7/355 cut-off events. [2025-03-14 01:51:13,796 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:51:13,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 355 events. 7/355 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 418 event pairs, 0 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 275. Up to 6 conditions per place. [2025-03-14 01:51:13,797 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 265 transitions, 540 flow [2025-03-14 01:51:13,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 265 transitions, 540 flow [2025-03-14 01:51:13,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:51:13,800 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3638f38e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:51:13,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-14 01:51:13,809 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:51:13,809 INFO L124 PetriNetUnfolderBase]: 1/160 cut-off events. [2025-03-14 01:51:13,809 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:51:13,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:13,809 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-03-14 01:51:13,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-14 01:51:13,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:13,810 INFO L85 PathProgramCache]: Analyzing trace with hash -268439924, now seen corresponding path program 1 times [2025-03-14 01:51:13,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:13,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152189728] [2025-03-14 01:51:13,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:13,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:13,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-14 01:51:13,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-14 01:51:13,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:13,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:13,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:13,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152189728] [2025-03-14 01:51:13,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152189728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:13,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:13,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:13,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534511035] [2025-03-14 01:51:13,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:13,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:13,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:13,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:13,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:13,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 265 [2025-03-14 01:51:13,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 265 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:13,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:13,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 265 [2025-03-14 01:51:13,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:14,801 INFO L124 PetriNetUnfolderBase]: 2216/7107 cut-off events. [2025-03-14 01:51:14,802 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-14 01:51:14,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10811 conditions, 7107 events. 2216/7107 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 68636 event pairs, 879 based on Foata normal form. 1/6349 useless extension candidates. Maximal degree in co-relation 9184. Up to 2089 conditions per place. [2025-03-14 01:51:14,835 INFO L140 encePairwiseOnDemand]: 248/265 looper letters, 46 selfloop transitions, 11 changer transitions 1/289 dead transitions. [2025-03-14 01:51:14,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 289 transitions, 707 flow [2025-03-14 01:51:14,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2025-03-14 01:51:14,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559748427672956 [2025-03-14 01:51:14,837 INFO L175 Difference]: Start difference. First operand has 267 places, 265 transitions, 540 flow. Second operand 3 states and 760 transitions. [2025-03-14 01:51:14,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 289 transitions, 707 flow [2025-03-14 01:51:14,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 289 transitions, 707 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:14,840 INFO L231 Difference]: Finished difference. Result has 271 places, 273 transitions, 630 flow [2025-03-14 01:51:14,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=271, PETRI_TRANSITIONS=273} [2025-03-14 01:51:14,841 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 4 predicate places. [2025-03-14 01:51:14,841 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 273 transitions, 630 flow [2025-03-14 01:51:14,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:14,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:14,841 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-03-14 01:51:14,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:51:14,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-14 01:51:14,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:14,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1855502647, now seen corresponding path program 1 times [2025-03-14 01:51:14,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:14,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371051219] [2025-03-14 01:51:14,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:14,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:14,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-14 01:51:14,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-14 01:51:14,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:14,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:14,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:14,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371051219] [2025-03-14 01:51:14,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371051219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:14,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:14,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:14,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707406160] [2025-03-14 01:51:14,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:14,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:14,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:14,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:14,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:14,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 265 [2025-03-14 01:51:14,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 273 transitions, 630 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-03-14 01:51:14,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:14,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 265 [2025-03-14 01:51:14,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:16,050 INFO L124 PetriNetUnfolderBase]: 2480/9018 cut-off events. [2025-03-14 01:51:16,051 INFO L125 PetriNetUnfolderBase]: For 2761/2931 co-relation queries the response was YES. [2025-03-14 01:51:16,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15784 conditions, 9018 events. 2480/9018 cut-off events. For 2761/2931 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 94794 event pairs, 1597 based on Foata normal form. 62/8284 useless extension candidates. Maximal degree in co-relation 13582. Up to 3442 conditions per place. [2025-03-14 01:51:16,108 INFO L140 encePairwiseOnDemand]: 257/265 looper letters, 42 selfloop transitions, 12 changer transitions 0/291 dead transitions. [2025-03-14 01:51:16,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 291 transitions, 798 flow [2025-03-14 01:51:16,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2025-03-14 01:51:16,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9383647798742139 [2025-03-14 01:51:16,110 INFO L175 Difference]: Start difference. First operand has 271 places, 273 transitions, 630 flow. Second operand 3 states and 746 transitions. [2025-03-14 01:51:16,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 291 transitions, 798 flow [2025-03-14 01:51:16,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 291 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:16,125 INFO L231 Difference]: Finished difference. Result has 272 places, 283 transitions, 714 flow [2025-03-14 01:51:16,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=272, PETRI_TRANSITIONS=283} [2025-03-14 01:51:16,127 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 5 predicate places. [2025-03-14 01:51:16,127 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 283 transitions, 714 flow [2025-03-14 01:51:16,127 INFO L472 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-03-14 01:51:16,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:16,127 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-03-14 01:51:16,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:51:16,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-14 01:51:16,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:16,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1925002889, now seen corresponding path program 1 times [2025-03-14 01:51:16,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:16,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191342829] [2025-03-14 01:51:16,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:16,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:16,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-14 01:51:16,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-14 01:51:16,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:16,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:16,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:16,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191342829] [2025-03-14 01:51:16,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191342829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:16,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:16,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:16,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691086534] [2025-03-14 01:51:16,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:16,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:16,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:16,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:16,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:16,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 265 [2025-03-14 01:51:16,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 283 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:16,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:16,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 265 [2025-03-14 01:51:16,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:17,260 INFO L124 PetriNetUnfolderBase]: 1878/8140 cut-off events. [2025-03-14 01:51:17,261 INFO L125 PetriNetUnfolderBase]: For 1127/2075 co-relation queries the response was YES. [2025-03-14 01:51:17,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13070 conditions, 8140 events. 1878/8140 cut-off events. For 1127/2075 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 89566 event pairs, 1092 based on Foata normal form. 7/7222 useless extension candidates. Maximal degree in co-relation 11327. Up to 1725 conditions per place. [2025-03-14 01:51:17,308 INFO L140 encePairwiseOnDemand]: 260/265 looper letters, 28 selfloop transitions, 4 changer transitions 0/294 dead transitions. [2025-03-14 01:51:17,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 294 transitions, 800 flow [2025-03-14 01:51:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2025-03-14 01:51:17,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2025-03-14 01:51:17,310 INFO L175 Difference]: Start difference. First operand has 272 places, 283 transitions, 714 flow. Second operand 3 states and 759 transitions. [2025-03-14 01:51:17,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 294 transitions, 800 flow [2025-03-14 01:51:17,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 294 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:17,323 INFO L231 Difference]: Finished difference. Result has 274 places, 286 transitions, 720 flow [2025-03-14 01:51:17,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=274, PETRI_TRANSITIONS=286} [2025-03-14 01:51:17,324 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 7 predicate places. [2025-03-14 01:51:17,325 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 286 transitions, 720 flow [2025-03-14 01:51:17,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:17,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:17,326 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-03-14 01:51:17,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:51:17,326 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-14 01:51:17,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:17,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1883509732, now seen corresponding path program 1 times [2025-03-14 01:51:17,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:17,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371448153] [2025-03-14 01:51:17,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:17,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:17,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-14 01:51:17,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-14 01:51:17,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:17,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:17,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:17,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371448153] [2025-03-14 01:51:17,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371448153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:17,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:17,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:17,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958394553] [2025-03-14 01:51:17,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:17,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:17,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:17,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:17,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:17,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 265 [2025-03-14 01:51:17,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 286 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:17,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:17,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 265 [2025-03-14 01:51:17,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:18,515 INFO L124 PetriNetUnfolderBase]: 2430/10427 cut-off events. [2025-03-14 01:51:18,515 INFO L125 PetriNetUnfolderBase]: For 1615/2592 co-relation queries the response was YES. [2025-03-14 01:51:18,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17122 conditions, 10427 events. 2430/10427 cut-off events. For 1615/2592 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 122065 event pairs, 1418 based on Foata normal form. 11/9279 useless extension candidates. Maximal degree in co-relation 15284. Up to 2447 conditions per place. [2025-03-14 01:51:18,565 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 34 selfloop transitions, 7 changer transitions 0/302 dead transitions. [2025-03-14 01:51:18,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 302 transitions, 849 flow [2025-03-14 01:51:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:18,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2025-03-14 01:51:18,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2025-03-14 01:51:18,567 INFO L175 Difference]: Start difference. First operand has 274 places, 286 transitions, 720 flow. Second operand 3 states and 759 transitions. [2025-03-14 01:51:18,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 302 transitions, 849 flow [2025-03-14 01:51:18,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 302 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:18,577 INFO L231 Difference]: Finished difference. Result has 276 places, 291 transitions, 768 flow [2025-03-14 01:51:18,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=276, PETRI_TRANSITIONS=291} [2025-03-14 01:51:18,580 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 9 predicate places. [2025-03-14 01:51:18,580 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 291 transitions, 768 flow [2025-03-14 01:51:18,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:18,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:18,580 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] [2025-03-14 01:51:18,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:51:18,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-14 01:51:18,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:18,581 INFO L85 PathProgramCache]: Analyzing trace with hash 26748505, now seen corresponding path program 1 times [2025-03-14 01:51:18,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:18,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361690138] [2025-03-14 01:51:18,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:18,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-14 01:51:18,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-14 01:51:18,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:18,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:18,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:18,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361690138] [2025-03-14 01:51:18,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361690138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:18,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:18,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:18,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549884216] [2025-03-14 01:51:18,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:18,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:18,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:18,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:18,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:18,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 265 [2025-03-14 01:51:18,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 291 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:18,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:18,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 265 [2025-03-14 01:51:18,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:19,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][273], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 220#L695-7true, 268#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 62#L712-2true, Black: 282#(= |#race~data~0| 0), 266#true, 290#true, 126#L695-2true, 285#true]) [2025-03-14 01:51:19,710 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-14 01:51:19,710 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:51:19,710 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:51:19,713 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:51:19,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 220#L695-7true, 268#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 62#L712-2true, 266#true, 290#true, Black: 282#(= |#race~data~0| 0), 264#L697-3true, 285#true]) [2025-03-14 01:51:19,829 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2025-03-14 01:51:19,829 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 01:51:19,829 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-14 01:51:19,829 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 01:51:19,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [40#L697true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 220#L695-7true, 268#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 62#L712-2true, 290#true, 266#true, Black: 282#(= |#race~data~0| 0), 285#true]) [2025-03-14 01:51:19,910 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-14 01:51:19,910 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:51:19,910 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-14 01:51:19,910 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:51:20,024 INFO L124 PetriNetUnfolderBase]: 4089/14024 cut-off events. [2025-03-14 01:51:20,024 INFO L125 PetriNetUnfolderBase]: For 5661/6065 co-relation queries the response was YES. [2025-03-14 01:51:20,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26408 conditions, 14024 events. 4089/14024 cut-off events. For 5661/6065 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 159001 event pairs, 2076 based on Foata normal form. 74/12674 useless extension candidates. Maximal degree in co-relation 22270. Up to 5204 conditions per place. [2025-03-14 01:51:20,092 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 49 selfloop transitions, 19 changer transitions 0/317 dead transitions. [2025-03-14 01:51:20,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 317 transitions, 1005 flow [2025-03-14 01:51:20,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2025-03-14 01:51:20,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9484276729559749 [2025-03-14 01:51:20,095 INFO L175 Difference]: Start difference. First operand has 276 places, 291 transitions, 768 flow. Second operand 3 states and 754 transitions. [2025-03-14 01:51:20,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 317 transitions, 1005 flow [2025-03-14 01:51:20,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 317 transitions, 991 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:20,101 INFO L231 Difference]: Finished difference. Result has 278 places, 306 transitions, 936 flow [2025-03-14 01:51:20,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=936, PETRI_PLACES=278, PETRI_TRANSITIONS=306} [2025-03-14 01:51:20,102 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 11 predicate places. [2025-03-14 01:51:20,102 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 306 transitions, 936 flow [2025-03-14 01:51:20,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:20,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:20,103 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-03-14 01:51:20,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:51:20,104 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-14 01:51:20,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:20,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1826042232, now seen corresponding path program 1 times [2025-03-14 01:51:20,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:20,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739129655] [2025-03-14 01:51:20,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:20,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:20,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-14 01:51:20,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-14 01:51:20,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:20,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:20,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:20,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:20,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739129655] [2025-03-14 01:51:20,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739129655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:20,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:20,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:51:20,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108327596] [2025-03-14 01:51:20,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:20,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:51:20,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:20,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:51:20,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:51:20,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 265 [2025-03-14 01:51:20,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 306 transitions, 936 flow. Second operand has 5 states, 5 states have (on average 239.4) internal successors, (1197), 5 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:20,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:20,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 265 [2025-03-14 01:51:20,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:21,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([767] L705-3-->L705-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_5| |v_#race~threads_alive~0_6|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_5|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_5|, #race~threads_alive~0=|v_#race~threads_alive~0_6|} AuxVars[] AssignedVars[#race~threads_alive~0][275], [Black: 272#(= |#race~threads_alive~0| 0), Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 220#L695-7true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), 61#L705-1true, Black: 275#true, 290#true, 266#true, Black: 282#(= |#race~data~0| 0), 126#L695-2true, 295#true]) [2025-03-14 01:51:21,504 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-03-14 01:51:21,504 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:51:21,504 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:51:21,504 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:51:21,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][278], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 220#L695-7true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 62#L712-2true, 290#true, Black: 282#(= |#race~data~0| 0), 266#true, 126#L695-2true, 295#true]) [2025-03-14 01:51:21,532 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-14 01:51:21,532 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:51:21,532 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:51:21,532 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:51:21,600 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][278], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 220#L695-7true, Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 62#L712-2true, 290#true, 266#true, Black: 282#(= |#race~data~0| 0), 126#L695-2true, 295#true]) [2025-03-14 01:51:21,600 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-14 01:51:21,600 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:51:21,600 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:51:21,600 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:51:21,600 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:51:21,607 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][278], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 220#L695-7true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 62#L712-2true, 290#true, 266#true, Black: 282#(= |#race~data~0| 0), 126#L695-2true, 295#true]) [2025-03-14 01:51:21,607 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-14 01:51:21,607 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:51:21,607 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:51:21,607 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:51:21,607 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:51:21,607 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:51:21,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][278], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), 49#L695-6true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 62#L712-2true, Black: 282#(= |#race~data~0| 0), 266#true, 290#true, 126#L695-2true, 295#true]) [2025-03-14 01:51:21,675 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-03-14 01:51:21,675 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:51:21,675 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:51:21,675 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 01:51:21,730 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 220#L695-7true, Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 62#L712-2true, 290#true, 266#true, Black: 282#(= |#race~data~0| 0), 264#L697-3true, 295#true]) [2025-03-14 01:51:21,730 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2025-03-14 01:51:21,730 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 01:51:21,731 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 01:51:21,731 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-14 01:51:21,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 220#L695-7true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 62#L712-2true, Black: 282#(= |#race~data~0| 0), 266#true, 290#true, 295#true, 261#threadErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-14 01:51:21,804 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-14 01:51:21,804 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:51:21,804 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:51:21,804 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:51:21,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([821] L695-5-->L695-4: Formula: (= (+ v_~threads_alive~0_6 1) |v_threadThread2of2ForFork0_#t~post5_3|) InVars {threadThread2of2ForFork0_#t~post5=|v_threadThread2of2ForFork0_#t~post5_3|} OutVars{threadThread2of2ForFork0_#t~post5=|v_threadThread2of2ForFork0_#t~post5_3|, ~threads_alive~0=v_~threads_alive~0_6} AuxVars[] AssignedVars[~threads_alive~0][293], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 160#L695-4true, 6#L695-4true, 290#true, 238#L706true, 266#true, Black: 282#(= |#race~data~0| 0), 295#true]) [2025-03-14 01:51:21,812 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2025-03-14 01:51:21,812 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-14 01:51:21,812 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-14 01:51:21,812 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-14 01:51:21,857 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 220#L695-7true, Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 62#L712-2true, Black: 282#(= |#race~data~0| 0), 290#true, 266#true, 264#L697-3true, 295#true]) [2025-03-14 01:51:21,857 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2025-03-14 01:51:21,857 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 01:51:21,857 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-14 01:51:21,857 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 01:51:21,857 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-14 01:51:21,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([792] L695-3-->L695-1: Formula: (= |v_#race~threads_alive~0_12| |v_threadThread1of2ForFork0_#t~nondet6_3|) InVars {threadThread1of2ForFork0_#t~nondet6=|v_threadThread1of2ForFork0_#t~nondet6_3|} OutVars{threadThread1of2ForFork0_#t~nondet6=|v_threadThread1of2ForFork0_#t~nondet6_3|, #race~threads_alive~0=|v_#race~threads_alive~0_12|} AuxVars[] AssignedVars[#race~threads_alive~0][224], [Black: 272#(= |#race~threads_alive~0| 0), Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 220#L695-7true, 268#true, 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 290#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 242#L706-3true, Black: 282#(= |#race~data~0| 0), 266#true, 117#L695-1true, 295#true]) [2025-03-14 01:51:21,875 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is not cut-off event [2025-03-14 01:51:21,875 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-03-14 01:51:21,875 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-03-14 01:51:21,875 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-03-14 01:51:21,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [40#L697true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 220#L695-7true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 62#L712-2true, Black: 282#(= |#race~data~0| 0), 266#true, 290#true, 295#true]) [2025-03-14 01:51:21,925 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-14 01:51:21,925 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-14 01:51:21,925 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-14 01:51:21,925 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:51:22,237 INFO L124 PetriNetUnfolderBase]: 4694/16323 cut-off events. [2025-03-14 01:51:22,237 INFO L125 PetriNetUnfolderBase]: For 7351/8212 co-relation queries the response was YES. [2025-03-14 01:51:22,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31425 conditions, 16323 events. 4694/16323 cut-off events. For 7351/8212 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 194312 event pairs, 1723 based on Foata normal form. 75/14508 useless extension candidates. Maximal degree in co-relation 16806. Up to 4159 conditions per place. [2025-03-14 01:51:22,375 INFO L140 encePairwiseOnDemand]: 257/265 looper letters, 45 selfloop transitions, 9 changer transitions 2/336 dead transitions. [2025-03-14 01:51:22,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 336 transitions, 1108 flow [2025-03-14 01:51:22,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:51:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:51:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1480 transitions. [2025-03-14 01:51:22,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9308176100628931 [2025-03-14 01:51:22,379 INFO L175 Difference]: Start difference. First operand has 278 places, 306 transitions, 936 flow. Second operand 6 states and 1480 transitions. [2025-03-14 01:51:22,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 336 transitions, 1108 flow [2025-03-14 01:51:22,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 336 transitions, 1070 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:22,410 INFO L231 Difference]: Finished difference. Result has 283 places, 313 transitions, 949 flow [2025-03-14 01:51:22,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=949, PETRI_PLACES=283, PETRI_TRANSITIONS=313} [2025-03-14 01:51:22,411 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 16 predicate places. [2025-03-14 01:51:22,411 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 313 transitions, 949 flow [2025-03-14 01:51:22,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 239.4) internal successors, (1197), 5 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:22,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:22,413 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1] [2025-03-14 01:51:22,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:51:22,413 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-14 01:51:22,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:22,414 INFO L85 PathProgramCache]: Analyzing trace with hash 278034833, now seen corresponding path program 1 times [2025-03-14 01:51:22,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:22,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482953144] [2025-03-14 01:51:22,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:22,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:22,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-14 01:51:22,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-14 01:51:22,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:22,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:22,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:22,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482953144] [2025-03-14 01:51:22,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482953144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:22,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:22,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:51:22,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663057042] [2025-03-14 01:51:22,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:22,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:51:22,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:22,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:51:22,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:51:22,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 265 [2025-03-14 01:51:22,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 313 transitions, 949 flow. Second operand has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:22,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:22,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 265 [2025-03-14 01:51:22,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:23,147 INFO L124 PetriNetUnfolderBase]: 321/2795 cut-off events. [2025-03-14 01:51:23,148 INFO L125 PetriNetUnfolderBase]: For 665/701 co-relation queries the response was YES. [2025-03-14 01:51:23,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4824 conditions, 2795 events. 321/2795 cut-off events. For 665/701 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 24155 event pairs, 119 based on Foata normal form. 86/2731 useless extension candidates. Maximal degree in co-relation 4242. Up to 283 conditions per place. [2025-03-14 01:51:23,163 INFO L140 encePairwiseOnDemand]: 253/265 looper letters, 11 selfloop transitions, 12 changer transitions 0/279 dead transitions. [2025-03-14 01:51:23,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 279 transitions, 770 flow [2025-03-14 01:51:23,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:51:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:51:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1253 transitions. [2025-03-14 01:51:23,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9456603773584905 [2025-03-14 01:51:23,165 INFO L175 Difference]: Start difference. First operand has 283 places, 313 transitions, 949 flow. Second operand 5 states and 1253 transitions. [2025-03-14 01:51:23,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 279 transitions, 770 flow [2025-03-14 01:51:23,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 279 transitions, 724 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-03-14 01:51:23,176 INFO L231 Difference]: Finished difference. Result has 277 places, 274 transitions, 687 flow [2025-03-14 01:51:23,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=687, PETRI_PLACES=277, PETRI_TRANSITIONS=274} [2025-03-14 01:51:23,177 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 10 predicate places. [2025-03-14 01:51:23,177 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 274 transitions, 687 flow [2025-03-14 01:51:23,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:23,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:23,178 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-03-14 01:51:23,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:51:23,178 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-14 01:51:23,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:23,180 INFO L85 PathProgramCache]: Analyzing trace with hash -222042109, now seen corresponding path program 1 times [2025-03-14 01:51:23,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:23,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118995245] [2025-03-14 01:51:23,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:23,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:23,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-14 01:51:23,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-14 01:51:23,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:23,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:23,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:23,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118995245] [2025-03-14 01:51:23,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118995245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:23,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:23,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:23,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907139781] [2025-03-14 01:51:23,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:23,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:23,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:23,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:23,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:23,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 265 [2025-03-14 01:51:23,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 274 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:23,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:23,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 265 [2025-03-14 01:51:23,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:23,657 INFO L124 PetriNetUnfolderBase]: 1083/4735 cut-off events. [2025-03-14 01:51:23,657 INFO L125 PetriNetUnfolderBase]: For 1576/1588 co-relation queries the response was YES. [2025-03-14 01:51:23,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8940 conditions, 4735 events. 1083/4735 cut-off events. For 1576/1588 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 45764 event pairs, 573 based on Foata normal form. 0/4440 useless extension candidates. Maximal degree in co-relation 8355. Up to 1492 conditions per place. [2025-03-14 01:51:23,674 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 34 selfloop transitions, 10 changer transitions 0/290 dead transitions. [2025-03-14 01:51:23,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 290 transitions, 839 flow [2025-03-14 01:51:23,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2025-03-14 01:51:23,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9534591194968554 [2025-03-14 01:51:23,676 INFO L175 Difference]: Start difference. First operand has 277 places, 274 transitions, 687 flow. Second operand 3 states and 758 transitions. [2025-03-14 01:51:23,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 290 transitions, 839 flow [2025-03-14 01:51:23,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 290 transitions, 818 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:51:23,681 INFO L231 Difference]: Finished difference. Result has 278 places, 280 transitions, 756 flow [2025-03-14 01:51:23,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=278, PETRI_TRANSITIONS=280} [2025-03-14 01:51:23,681 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 11 predicate places. [2025-03-14 01:51:23,681 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 280 transitions, 756 flow [2025-03-14 01:51:23,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:23,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:23,682 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-03-14 01:51:23,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:51:23,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-14 01:51:23,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:23,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1158783256, now seen corresponding path program 1 times [2025-03-14 01:51:23,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:23,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899994026] [2025-03-14 01:51:23,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:23,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:23,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-14 01:51:23,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-14 01:51:23,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:23,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:23,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:23,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:23,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899994026] [2025-03-14 01:51:23,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899994026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:23,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:23,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:51:23,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621618576] [2025-03-14 01:51:23,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:23,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:23,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:23,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:23,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:23,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 265 [2025-03-14 01:51:23,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 280 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:23,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:23,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 265 [2025-03-14 01:51:23,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:24,230 INFO L124 PetriNetUnfolderBase]: 646/4760 cut-off events. [2025-03-14 01:51:24,231 INFO L125 PetriNetUnfolderBase]: For 1804/1957 co-relation queries the response was YES. [2025-03-14 01:51:24,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8534 conditions, 4760 events. 646/4760 cut-off events. For 1804/1957 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 50318 event pairs, 112 based on Foata normal form. 15/4565 useless extension candidates. Maximal degree in co-relation 7323. Up to 698 conditions per place. [2025-03-14 01:51:24,259 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 21 selfloop transitions, 9 changer transitions 0/293 dead transitions. [2025-03-14 01:51:24,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 293 transitions, 857 flow [2025-03-14 01:51:24,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:24,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 770 transitions. [2025-03-14 01:51:24,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9685534591194969 [2025-03-14 01:51:24,261 INFO L175 Difference]: Start difference. First operand has 278 places, 280 transitions, 756 flow. Second operand 3 states and 770 transitions. [2025-03-14 01:51:24,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 293 transitions, 857 flow [2025-03-14 01:51:24,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 293 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:24,268 INFO L231 Difference]: Finished difference. Result has 279 places, 287 transitions, 796 flow [2025-03-14 01:51:24,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=279, PETRI_TRANSITIONS=287} [2025-03-14 01:51:24,269 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 12 predicate places. [2025-03-14 01:51:24,269 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 287 transitions, 796 flow [2025-03-14 01:51:24,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:24,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:24,270 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-03-14 01:51:24,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:51:24,270 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-14 01:51:24,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:24,271 INFO L85 PathProgramCache]: Analyzing trace with hash 237202408, now seen corresponding path program 2 times [2025-03-14 01:51:24,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:24,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39275204] [2025-03-14 01:51:24,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:51:24,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:24,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 1 equivalence classes. [2025-03-14 01:51:24,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-14 01:51:24,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:51:24,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:24,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:24,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39275204] [2025-03-14 01:51:24,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39275204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:24,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:24,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:51:24,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366642007] [2025-03-14 01:51:24,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:24,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:51:24,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:24,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:51:24,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:51:24,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 265 [2025-03-14 01:51:24,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 287 transitions, 796 flow. Second operand has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:24,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:24,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 265 [2025-03-14 01:51:24,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:24,933 INFO L124 PetriNetUnfolderBase]: 303/2908 cut-off events. [2025-03-14 01:51:24,934 INFO L125 PetriNetUnfolderBase]: For 998/1192 co-relation queries the response was YES. [2025-03-14 01:51:24,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5235 conditions, 2908 events. 303/2908 cut-off events. For 998/1192 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 26122 event pairs, 40 based on Foata normal form. 67/2874 useless extension candidates. Maximal degree in co-relation 4239. Up to 326 conditions per place. [2025-03-14 01:51:24,943 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 28 selfloop transitions, 8 changer transitions 0/293 dead transitions. [2025-03-14 01:51:24,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 293 transitions, 875 flow [2025-03-14 01:51:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:51:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:51:24,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1256 transitions. [2025-03-14 01:51:24,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479245283018868 [2025-03-14 01:51:24,945 INFO L175 Difference]: Start difference. First operand has 279 places, 287 transitions, 796 flow. Second operand 5 states and 1256 transitions. [2025-03-14 01:51:24,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 293 transitions, 875 flow [2025-03-14 01:51:24,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 293 transitions, 862 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:51:24,950 INFO L231 Difference]: Finished difference. Result has 282 places, 282 transitions, 759 flow [2025-03-14 01:51:24,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=759, PETRI_PLACES=282, PETRI_TRANSITIONS=282} [2025-03-14 01:51:24,951 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 15 predicate places. [2025-03-14 01:51:24,951 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 282 transitions, 759 flow [2025-03-14 01:51:24,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:24,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:24,952 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, 1] [2025-03-14 01:51:24,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:51:24,952 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-14 01:51:24,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:24,952 INFO L85 PathProgramCache]: Analyzing trace with hash -640625999, now seen corresponding path program 1 times [2025-03-14 01:51:24,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:24,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008650586] [2025-03-14 01:51:24,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:24,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:24,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-14 01:51:24,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-14 01:51:24,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:24,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:25,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:25,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:25,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008650586] [2025-03-14 01:51:25,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008650586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:25,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:25,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:25,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867087677] [2025-03-14 01:51:25,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:25,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:25,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:25,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:25,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:25,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 265 [2025-03-14 01:51:25,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 282 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:25,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:25,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 265 [2025-03-14 01:51:25,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:25,338 INFO L124 PetriNetUnfolderBase]: 503/3655 cut-off events. [2025-03-14 01:51:25,338 INFO L125 PetriNetUnfolderBase]: For 2120/2364 co-relation queries the response was YES. [2025-03-14 01:51:25,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7229 conditions, 3655 events. 503/3655 cut-off events. For 2120/2364 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 35043 event pairs, 226 based on Foata normal form. 6/3506 useless extension candidates. Maximal degree in co-relation 6430. Up to 891 conditions per place. [2025-03-14 01:51:25,354 INFO L140 encePairwiseOnDemand]: 262/265 looper letters, 37 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2025-03-14 01:51:25,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 284 transitions, 853 flow [2025-03-14 01:51:25,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:25,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2025-03-14 01:51:25,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9270440251572327 [2025-03-14 01:51:25,358 INFO L175 Difference]: Start difference. First operand has 282 places, 282 transitions, 759 flow. Second operand 3 states and 737 transitions. [2025-03-14 01:51:25,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 284 transitions, 853 flow [2025-03-14 01:51:25,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 284 transitions, 841 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:51:25,365 INFO L231 Difference]: Finished difference. Result has 280 places, 281 transitions, 752 flow [2025-03-14 01:51:25,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=280, PETRI_TRANSITIONS=281} [2025-03-14 01:51:25,366 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 13 predicate places. [2025-03-14 01:51:25,367 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 281 transitions, 752 flow [2025-03-14 01:51:25,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:25,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:25,367 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-03-14 01:51:25,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:51:25,367 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-14 01:51:25,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:25,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1127456823, now seen corresponding path program 1 times [2025-03-14 01:51:25,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:25,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452617232] [2025-03-14 01:51:25,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:25,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:25,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-14 01:51:25,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-14 01:51:25,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:25,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:51:25,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:51:25,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-14 01:51:25,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-14 01:51:25,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:25,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:51:25,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:51:25,441 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:51:25,441 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-14 01:51:25,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-14 01:51:25,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-14 01:51:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-14 01:51:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-14 01:51:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-14 01:51:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-14 01:51:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-14 01:51:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-14 01:51:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-14 01:51:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-14 01:51:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-14 01:51:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-14 01:51:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-14 01:51:25,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:51:25,442 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:25,443 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:51:25,443 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 01:51:25,472 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:51:25,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 301 places, 297 transitions, 612 flow [2025-03-14 01:51:25,500 INFO L124 PetriNetUnfolderBase]: 9/436 cut-off events. [2025-03-14 01:51:25,500 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:51:25,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 436 events. 9/436 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 596 event pairs, 0 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 359. Up to 8 conditions per place. [2025-03-14 01:51:25,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 301 places, 297 transitions, 612 flow [2025-03-14 01:51:25,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 301 places, 297 transitions, 612 flow [2025-03-14 01:51:25,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:51:25,503 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3638f38e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:51:25,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-14 01:51:25,508 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:51:25,509 INFO L124 PetriNetUnfolderBase]: 1/160 cut-off events. [2025-03-14 01:51:25,509 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:51:25,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:25,509 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-03-14 01:51:25,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:51:25,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:25,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1725880020, now seen corresponding path program 1 times [2025-03-14 01:51:25,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:25,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788264504] [2025-03-14 01:51:25,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:25,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:25,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-14 01:51:25,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-14 01:51:25,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:25,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:25,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:25,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788264504] [2025-03-14 01:51:25,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788264504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:25,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:25,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:25,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83290336] [2025-03-14 01:51:25,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:25,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:25,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:25,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:25,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:25,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 297 [2025-03-14 01:51:25,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 297 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:25,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:25,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 297 [2025-03-14 01:51:25,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:34,001 INFO L124 PetriNetUnfolderBase]: 35239/82973 cut-off events. [2025-03-14 01:51:34,001 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2025-03-14 01:51:34,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133785 conditions, 82973 events. 35239/82973 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 2909. Compared 1040022 event pairs, 14941 based on Foata normal form. 1/74097 useless extension candidates. Maximal degree in co-relation 112523. Up to 27933 conditions per place. [2025-03-14 01:51:34,602 INFO L140 encePairwiseOnDemand]: 276/297 looper letters, 60 selfloop transitions, 14 changer transitions 1/329 dead transitions. [2025-03-14 01:51:34,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 329 transitions, 836 flow [2025-03-14 01:51:34,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:34,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 847 transitions. [2025-03-14 01:51:34,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506172839506173 [2025-03-14 01:51:34,608 INFO L175 Difference]: Start difference. First operand has 301 places, 297 transitions, 612 flow. Second operand 3 states and 847 transitions. [2025-03-14 01:51:34,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 329 transitions, 836 flow [2025-03-14 01:51:34,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 329 transitions, 832 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:34,614 INFO L231 Difference]: Finished difference. Result has 305 places, 308 transitions, 726 flow [2025-03-14 01:51:34,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=305, PETRI_TRANSITIONS=308} [2025-03-14 01:51:34,614 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, 4 predicate places. [2025-03-14 01:51:34,615 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 308 transitions, 726 flow [2025-03-14 01:51:34,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:34,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:34,615 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-03-14 01:51:34,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:51:34,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:51:34,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1830283648, now seen corresponding path program 1 times [2025-03-14 01:51:34,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:34,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348110543] [2025-03-14 01:51:34,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:34,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:34,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-14 01:51:34,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-14 01:51:34,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:34,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:34,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:34,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348110543] [2025-03-14 01:51:34,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348110543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:34,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:34,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:34,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303222912] [2025-03-14 01:51:34,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:34,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:34,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:34,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:34,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:34,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 297 [2025-03-14 01:51:34,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 308 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:34,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:34,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 297 [2025-03-14 01:51:34,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:38,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 74#L712-2true, 298#true, 164#L695-7true, 302#true, 309#true, 300#true, 62#L691true, 306#(= |#race~threads_alive~0| 0), 209#L695-7true]) [2025-03-14 01:51:38,901 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-03-14 01:51:38,901 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:51:38,901 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:51:38,901 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:51:38,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 74#L712-2true, 298#true, 302#true, 309#true, 300#true, 62#L691true, 68#L695-6true, 306#(= |#race~threads_alive~0| 0), 209#L695-7true]) [2025-03-14 01:51:38,901 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-03-14 01:51:38,901 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:38,901 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:38,901 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:38,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 74#L712-2true, 298#true, 164#L695-7true, 302#true, 309#true, 300#true, 62#L691true, 306#(= |#race~threads_alive~0| 0), 237#L695-6true]) [2025-03-14 01:51:38,901 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-03-14 01:51:38,901 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:38,901 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:38,901 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:39,098 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 74#L712-2true, 298#true, 302#true, 164#L695-7true, 309#true, 300#true, 62#L691true, 306#(= |#race~threads_alive~0| 0), 237#L695-6true]) [2025-03-14 01:51:39,098 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-03-14 01:51:39,098 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:39,098 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:39,099 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-03-14 01:51:39,099 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:39,100 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 74#L712-2true, 298#true, 302#true, 309#true, 300#true, 62#L691true, 68#L695-6true, 306#(= |#race~threads_alive~0| 0), 209#L695-7true]) [2025-03-14 01:51:39,100 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-03-14 01:51:39,100 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:39,100 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-03-14 01:51:39,100 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:39,100 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:39,294 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 74#L712-2true, 298#true, 302#true, 164#L695-7true, 309#true, 300#true, 62#L691true, 306#(= |#race~threads_alive~0| 0), 209#L695-7true]) [2025-03-14 01:51:39,295 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-03-14 01:51:39,295 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:51:39,295 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-03-14 01:51:39,295 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:51:39,295 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:51:39,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 74#L712-2true, 298#true, 302#true, 164#L695-7true, 309#true, 300#true, 62#L691true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:39,295 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-03-14 01:51:39,295 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:51:39,295 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:51:39,295 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-03-14 01:51:40,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [Black: 304#true, 74#L712-2true, 298#true, 302#true, 137#L695-1true, 309#true, 300#true, 62#L691true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:40,313 INFO L294 olderBase$Statistics]: this new event has 280 ancestors and is cut-off event [2025-03-14 01:51:40,313 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-03-14 01:51:40,313 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:40,313 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-03-14 01:51:40,315 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [147#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 304#true, 74#L712-2true, 298#true, 302#true, 309#true, 62#L691true, 300#true, 82#L695-1true, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:40,315 INFO L294 olderBase$Statistics]: this new event has 280 ancestors and is cut-off event [2025-03-14 01:51:40,315 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:40,315 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-03-14 01:51:40,315 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-03-14 01:51:41,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [17#L697true, Black: 304#true, 74#L712-2true, 298#true, 302#true, 309#true, 300#true, 62#L691true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:41,652 INFO L294 olderBase$Statistics]: this new event has 284 ancestors and is cut-off event [2025-03-14 01:51:41,652 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-03-14 01:51:41,652 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-03-14 01:51:41,652 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-03-14 01:51:41,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [147#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 304#true, 74#L712-2true, 298#true, 302#true, 282#L697true, 309#true, 62#L691true, 300#true, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:41,654 INFO L294 olderBase$Statistics]: this new event has 284 ancestors and is cut-off event [2025-03-14 01:51:41,654 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-03-14 01:51:41,655 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-03-14 01:51:41,655 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-03-14 01:51:41,657 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 74#L712-2true, 298#true, 164#L695-7true, 302#true, 309#true, 300#true, 249#L693true, 306#(= |#race~threads_alive~0| 0), 209#L695-7true]) [2025-03-14 01:51:41,657 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-03-14 01:51:41,657 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-14 01:51:41,657 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-14 01:51:41,657 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-14 01:51:41,657 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 74#L712-2true, 298#true, 302#true, 309#true, 300#true, 249#L693true, 68#L695-6true, 306#(= |#race~threads_alive~0| 0), 209#L695-7true]) [2025-03-14 01:51:41,657 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-03-14 01:51:41,657 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:41,657 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:41,657 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:41,657 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 74#L712-2true, 298#true, 164#L695-7true, 302#true, 309#true, 300#true, 249#L693true, 306#(= |#race~threads_alive~0| 0), 237#L695-6true]) [2025-03-14 01:51:41,657 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-03-14 01:51:41,657 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:41,657 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:41,657 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:41,966 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 74#L712-2true, 298#true, 302#true, 164#L695-7true, 309#true, 249#L693true, 300#true, 306#(= |#race~threads_alive~0| 0), 237#L695-6true]) [2025-03-14 01:51:41,966 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-03-14 01:51:41,966 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:41,966 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:41,966 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-03-14 01:51:41,966 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:41,969 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 74#L712-2true, 298#true, 302#true, 309#true, 300#true, 249#L693true, 68#L695-6true, 306#(= |#race~threads_alive~0| 0), 209#L695-7true]) [2025-03-14 01:51:41,969 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-03-14 01:51:41,969 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:41,969 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:41,969 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-03-14 01:51:41,969 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:42,488 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 74#L712-2true, 298#true, 302#true, 164#L695-7true, 309#true, 249#L693true, 300#true, 306#(= |#race~threads_alive~0| 0), 209#L695-7true]) [2025-03-14 01:51:42,488 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-03-14 01:51:42,488 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-03-14 01:51:42,488 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-14 01:51:42,488 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-14 01:51:42,488 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-14 01:51:42,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 74#L712-2true, 298#true, 302#true, 164#L695-7true, 309#true, 249#L693true, 300#true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:42,489 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-03-14 01:51:42,489 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-14 01:51:42,489 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-03-14 01:51:42,489 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-14 01:51:42,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [201#L694true, Black: 304#true, 74#L712-2true, 298#true, 164#L695-7true, 302#true, 309#true, 300#true, 306#(= |#race~threads_alive~0| 0), 209#L695-7true]) [2025-03-14 01:51:42,490 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-14 01:51:42,491 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-14 01:51:42,491 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-14 01:51:42,491 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-14 01:51:42,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [201#L694true, Black: 304#true, 74#L712-2true, 298#true, 302#true, 309#true, 300#true, 68#L695-6true, 306#(= |#race~threads_alive~0| 0), 209#L695-7true]) [2025-03-14 01:51:42,491 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-03-14 01:51:42,491 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:42,491 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:42,491 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:42,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [201#L694true, Black: 304#true, 74#L712-2true, 298#true, 164#L695-7true, 302#true, 309#true, 300#true, 306#(= |#race~threads_alive~0| 0), 237#L695-6true]) [2025-03-14 01:51:42,491 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-03-14 01:51:42,491 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:42,491 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:42,491 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:42,748 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [201#L694true, Black: 304#true, 74#L712-2true, 298#true, 302#true, 164#L695-7true, 309#true, 300#true, 306#(= |#race~threads_alive~0| 0), 237#L695-6true]) [2025-03-14 01:51:42,748 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-03-14 01:51:42,748 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:42,748 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-14 01:51:42,748 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:42,748 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:42,750 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [201#L694true, Black: 304#true, 74#L712-2true, 298#true, 302#true, 309#true, 300#true, 68#L695-6true, 306#(= |#race~threads_alive~0| 0), 209#L695-7true]) [2025-03-14 01:51:42,750 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-03-14 01:51:42,750 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:42,750 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:42,750 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-14 01:51:42,750 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:43,041 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [201#L694true, Black: 304#true, 74#L712-2true, 298#true, 302#true, 164#L695-7true, 309#true, 300#true, 306#(= |#race~threads_alive~0| 0), 209#L695-7true]) [2025-03-14 01:51:43,041 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-14 01:51:43,041 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-14 01:51:43,041 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-14 01:51:43,041 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-14 01:51:43,041 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-14 01:51:43,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [201#L694true, Black: 304#true, 74#L712-2true, 298#true, 302#true, 164#L695-7true, 309#true, 300#true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:43,042 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-14 01:51:43,042 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-14 01:51:43,042 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-14 01:51:43,042 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-14 01:51:43,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [Black: 304#true, 74#L712-2true, 298#true, 302#true, 137#L695-1true, 309#true, 300#true, 249#L693true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:43,769 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2025-03-14 01:51:43,769 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-03-14 01:51:43,769 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2025-03-14 01:51:43,769 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-03-14 01:51:43,772 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [147#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 304#true, 74#L712-2true, 298#true, 302#true, 309#true, 300#true, 249#L693true, 82#L695-1true, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:43,772 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2025-03-14 01:51:43,772 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-03-14 01:51:43,772 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-03-14 01:51:43,772 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2025-03-14 01:51:44,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [201#L694true, Black: 304#true, 74#L712-2true, 298#true, 302#true, 309#true, 137#L695-1true, 300#true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:44,261 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2025-03-14 01:51:44,261 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-14 01:51:44,261 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-14 01:51:44,261 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-03-14 01:51:44,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [201#L694true, 147#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 304#true, 74#L712-2true, 298#true, 302#true, 309#true, 300#true, 82#L695-1true, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:44,264 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2025-03-14 01:51:44,264 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-14 01:51:44,264 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-14 01:51:44,264 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-03-14 01:51:44,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [17#L697true, Black: 304#true, 74#L712-2true, 298#true, 302#true, 309#true, 300#true, 249#L693true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:44,906 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2025-03-14 01:51:44,906 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-03-14 01:51:44,906 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-14 01:51:44,906 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-14 01:51:44,910 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [147#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 304#true, 74#L712-2true, 298#true, 302#true, 282#L697true, 309#true, 300#true, 249#L693true, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:44,910 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2025-03-14 01:51:44,910 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-14 01:51:44,910 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-14 01:51:44,910 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-03-14 01:51:45,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [17#L697true, 201#L694true, Black: 304#true, 74#L712-2true, 298#true, 302#true, 309#true, 300#true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:45,311 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2025-03-14 01:51:45,311 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-03-14 01:51:45,311 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-03-14 01:51:45,311 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2025-03-14 01:51:45,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [201#L694true, Black: 304#true, 147#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 74#L712-2true, 298#true, 302#true, 282#L697true, 309#true, 300#true, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:45,314 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2025-03-14 01:51:45,314 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2025-03-14 01:51:45,314 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-03-14 01:51:45,314 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-03-14 01:51:47,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [17#L697true, Black: 304#true, 74#L712-2true, 298#true, 282#L697true, 302#true, 309#true, 300#true, 306#(= |#race~threads_alive~0| 0), 158#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-14 01:51:47,109 INFO L294 olderBase$Statistics]: this new event has 307 ancestors and is cut-off event [2025-03-14 01:51:47,109 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-14 01:51:47,109 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-14 01:51:47,109 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-03-14 01:51:47,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [17#L697true, Black: 304#true, 74#L712-2true, 298#true, 302#true, 309#true, 300#true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 125#L697true, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:47,110 INFO L294 olderBase$Statistics]: this new event has 307 ancestors and is cut-off event [2025-03-14 01:51:47,110 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-03-14 01:51:47,110 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-14 01:51:47,110 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-14 01:51:47,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [Black: 304#true, 147#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 74#L712-2true, 298#true, 302#true, 282#L697true, 309#true, 300#true, 125#L697true, 306#(= |#race~threads_alive~0| 0)]) [2025-03-14 01:51:47,112 INFO L294 olderBase$Statistics]: this new event has 307 ancestors and is cut-off event [2025-03-14 01:51:47,112 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-14 01:51:47,112 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-14 01:51:47,112 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-03-14 01:51:47,246 INFO L124 PetriNetUnfolderBase]: 38618/104949 cut-off events. [2025-03-14 01:51:47,246 INFO L125 PetriNetUnfolderBase]: For 39434/42992 co-relation queries the response was YES. [2025-03-14 01:51:47,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197504 conditions, 104949 events. 38618/104949 cut-off events. For 39434/42992 co-relation queries the response was YES. Maximal size of possible extension queue 3237. Compared 1448944 event pairs, 24931 based on Foata normal form. 604/95312 useless extension candidates. Maximal degree in co-relation 195212. Up to 46398 conditions per place. [2025-03-14 01:51:48,117 INFO L140 encePairwiseOnDemand]: 287/297 looper letters, 55 selfloop transitions, 16 changer transitions 0/334 dead transitions. [2025-03-14 01:51:48,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 334 transitions, 956 flow [2025-03-14 01:51:48,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 834 transitions. [2025-03-14 01:51:48,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.936026936026936 [2025-03-14 01:51:48,119 INFO L175 Difference]: Start difference. First operand has 305 places, 308 transitions, 726 flow. Second operand 3 states and 834 transitions. [2025-03-14 01:51:48,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 334 transitions, 956 flow [2025-03-14 01:51:48,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 334 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:48,274 INFO L231 Difference]: Finished difference. Result has 306 places, 322 transitions, 844 flow [2025-03-14 01:51:48,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=844, PETRI_PLACES=306, PETRI_TRANSITIONS=322} [2025-03-14 01:51:48,275 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, 5 predicate places. [2025-03-14 01:51:48,275 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 322 transitions, 844 flow [2025-03-14 01:51:48,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:48,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:48,276 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-03-14 01:51:48,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:51:48,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:51:48,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:48,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1588175735, now seen corresponding path program 1 times [2025-03-14 01:51:48,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:48,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117633284] [2025-03-14 01:51:48,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:48,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:48,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-14 01:51:48,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-14 01:51:48,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:48,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:48,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:48,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:48,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117633284] [2025-03-14 01:51:48,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117633284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:48,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:48,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:48,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180950138] [2025-03-14 01:51:48,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:48,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:48,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:48,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:48,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:48,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 297 [2025-03-14 01:51:48,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 322 transitions, 844 flow. Second operand has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:48,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:48,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 297 [2025-03-14 01:51:48,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:51,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 74#L712-2true, 298#true, 240#threadENTRYtrue, 314#true, 302#true, 164#L695-7true, 309#true, Black: 311#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 300#true, 237#L695-6true]) [2025-03-14 01:51:51,620 INFO L294 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2025-03-14 01:51:51,620 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:51:51,620 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:51:51,620 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:51:51,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 298#true, 240#threadENTRYtrue, 74#L712-2true, 314#true, 302#true, 309#true, Black: 311#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 300#true, 68#L695-6true, 209#L695-7true]) [2025-03-14 01:51:51,621 INFO L294 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2025-03-14 01:51:51,621 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:51:51,621 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:51:51,621 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:51:51,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 298#true, 74#L712-2true, 240#threadENTRYtrue, 314#true, 302#true, 164#L695-7true, 309#true, Black: 311#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 300#true, 209#L695-7true]) [2025-03-14 01:51:51,813 INFO L294 olderBase$Statistics]: this new event has 274 ancestors and is cut-off event [2025-03-14 01:51:51,813 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-14 01:51:51,813 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-14 01:51:51,813 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event