./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.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-race-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:51:01,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:51:01,928 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:01,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:51:01,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:51:01,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:51:01,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:51:01,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:51:01,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:51:01,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:51:01,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:51:01,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:51:01,945 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:51:01,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:51:01,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:51:01,945 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:51:01,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:51:01,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:51:01,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:51:01,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:51:01,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:51:01,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:51:01,945 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:51:01,945 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:51:01,945 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:51:01,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:51:01,945 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:51:01,945 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:51:01,946 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:51:01,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:51:01,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:51:01,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:51:01,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:51:01,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:51:01,946 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:51:01,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:51:01,946 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:51:01,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:51:01,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:51:01,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:51:01,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:51:01,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:51:01,946 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb [2025-03-14 01:51:02,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:51:02,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:51:02,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:51:02,171 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:51:02,171 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:51:02,173 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-race-4.i [2025-03-14 01:51:03,270 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aef9b16c0/6520b3d40a9b46a3902af57e7b61edff/FLAG8ded1567b [2025-03-14 01:51:03,506 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:51:03,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2025-03-14 01:51:03,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aef9b16c0/6520b3d40a9b46a3902af57e7b61edff/FLAG8ded1567b [2025-03-14 01:51:03,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aef9b16c0/6520b3d40a9b46a3902af57e7b61edff [2025-03-14 01:51:03,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:51:03,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:51:03,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:51:03,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:51:03,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:51:03,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:51:03" (1/1) ... [2025-03-14 01:51:03,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e51604b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:03, skipping insertion in model container [2025-03-14 01:51:03,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:51:03" (1/1) ... [2025-03-14 01:51:03,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:51:03,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:51:03,847 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:51:03,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:51:03,929 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:51:03,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:03 WrapperNode [2025-03-14 01:51:03,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:51:03,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:51:03,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:51:03,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:51:03,935 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:03" (1/1) ... [2025-03-14 01:51:03,943 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:03" (1/1) ... [2025-03-14 01:51:03,958 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-03-14 01:51:03,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:51:03,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:51:03,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:51:03,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:51:03,964 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:03" (1/1) ... [2025-03-14 01:51:03,964 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:03" (1/1) ... [2025-03-14 01:51:03,966 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:03" (1/1) ... [2025-03-14 01:51:03,966 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:03" (1/1) ... [2025-03-14 01:51:03,972 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:03" (1/1) ... [2025-03-14 01:51:03,973 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:03" (1/1) ... [2025-03-14 01:51:03,974 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:03" (1/1) ... [2025-03-14 01:51:03,975 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:03" (1/1) ... [2025-03-14 01:51:03,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:51:03,977 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:51:03,977 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:51:03,977 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:51:03,978 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:03" (1/1) ... [2025-03-14 01:51:03,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:51:03,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:51:04,007 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:04,011 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:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:51:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:51:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:51:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-14 01:51:04,026 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-14 01:51:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:51:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:51:04,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:51:04,027 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:04,130 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:51:04,132 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:51:04,364 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:51:04,365 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:51:04,365 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:51:04,388 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:51:04,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:51:04 BoogieIcfgContainer [2025-03-14 01:51:04,388 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:51:04,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:51:04,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:51:04,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:51:04,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:51:03" (1/3) ... [2025-03-14 01:51:04,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14196d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:51:04, skipping insertion in model container [2025-03-14 01:51:04,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:03" (2/3) ... [2025-03-14 01:51:04,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14196d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:51:04, skipping insertion in model container [2025-03-14 01:51:04,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:51:04" (3/3) ... [2025-03-14 01:51:04,394 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i [2025-03-14 01:51:04,405 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:51:04,407 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer-race-4.i that has 2 procedures, 228 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-14 01:51:04,407 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:51:04,458 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:51:04,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 231 transitions, 466 flow [2025-03-14 01:51:04,577 INFO L124 PetriNetUnfolderBase]: 5/272 cut-off events. [2025-03-14 01:51:04,581 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:51:04,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 272 events. 5/272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 239 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 192. Up to 4 conditions per place. [2025-03-14 01:51:04,586 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 231 transitions, 466 flow [2025-03-14 01:51:04,591 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 231 transitions, 466 flow [2025-03-14 01:51:04,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:51:04,605 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;@627ba445, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:51:04,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-14 01:51:04,639 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:51:04,639 INFO L124 PetriNetUnfolderBase]: 1/160 cut-off events. [2025-03-14 01:51:04,639 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:51:04,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:04,642 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:04,642 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:04,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:04,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2002374581, now seen corresponding path program 1 times [2025-03-14 01:51:04,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:04,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584068388] [2025-03-14 01:51:04,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:04,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:04,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-14 01:51:04,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-14 01:51:04,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:04,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:05,030 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:05,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:05,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584068388] [2025-03-14 01:51:05,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584068388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:05,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:05,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:05,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609300543] [2025-03-14 01:51:05,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:05,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:05,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:05,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:05,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:05,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 231 [2025-03-14 01:51:05,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 231 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:05,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:05,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 231 [2025-03-14 01:51:05,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:05,252 INFO L124 PetriNetUnfolderBase]: 98/684 cut-off events. [2025-03-14 01:51:05,252 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:51:05,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 684 events. 98/684 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3145 event pairs, 33 based on Foata normal form. 1/629 useless extension candidates. Maximal degree in co-relation 707. Up to 138 conditions per place. [2025-03-14 01:51:05,257 INFO L140 encePairwiseOnDemand]: 218/231 looper letters, 32 selfloop transitions, 8 changer transitions 1/247 dead transitions. [2025-03-14 01:51:05,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 247 transitions, 578 flow [2025-03-14 01:51:05,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:05,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2025-03-14 01:51:05,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9624819624819625 [2025-03-14 01:51:05,273 INFO L175 Difference]: Start difference. First operand has 231 places, 231 transitions, 466 flow. Second operand 3 states and 667 transitions. [2025-03-14 01:51:05,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 247 transitions, 578 flow [2025-03-14 01:51:05,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 247 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:05,282 INFO L231 Difference]: Finished difference. Result has 235 places, 236 transitions, 530 flow [2025-03-14 01:51:05,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=235, PETRI_TRANSITIONS=236} [2025-03-14 01:51:05,286 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 4 predicate places. [2025-03-14 01:51:05,287 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 236 transitions, 530 flow [2025-03-14 01:51:05,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:05,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:05,287 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:05,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:51:05,289 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:05,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:05,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1075873601, now seen corresponding path program 1 times [2025-03-14 01:51:05,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:05,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028740902] [2025-03-14 01:51:05,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:05,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:05,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-14 01:51:05,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-14 01:51:05,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:05,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:05,439 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:05,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:05,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028740902] [2025-03-14 01:51:05,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028740902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:05,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:05,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:05,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60582602] [2025-03-14 01:51:05,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:05,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:05,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:05,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:05,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:05,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 231 [2025-03-14 01:51:05,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 236 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:05,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:05,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 231 [2025-03-14 01:51:05,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:05,602 INFO L124 PetriNetUnfolderBase]: 114/812 cut-off events. [2025-03-14 01:51:05,603 INFO L125 PetriNetUnfolderBase]: For 164/171 co-relation queries the response was YES. [2025-03-14 01:51:05,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 812 events. 114/812 cut-off events. For 164/171 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4228 event pairs, 72 based on Foata normal form. 5/762 useless extension candidates. Maximal degree in co-relation 1025. Up to 226 conditions per place. [2025-03-14 01:51:05,610 INFO L140 encePairwiseOnDemand]: 225/231 looper letters, 29 selfloop transitions, 7 changer transitions 0/245 dead transitions. [2025-03-14 01:51:05,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 245 transitions, 630 flow [2025-03-14 01:51:05,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:05,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2025-03-14 01:51:05,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9408369408369408 [2025-03-14 01:51:05,612 INFO L175 Difference]: Start difference. First operand has 235 places, 236 transitions, 530 flow. Second operand 3 states and 652 transitions. [2025-03-14 01:51:05,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 245 transitions, 630 flow [2025-03-14 01:51:05,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 245 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:05,620 INFO L231 Difference]: Finished difference. Result has 236 places, 241 transitions, 570 flow [2025-03-14 01:51:05,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=236, PETRI_TRANSITIONS=241} [2025-03-14 01:51:05,621 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 5 predicate places. [2025-03-14 01:51:05,621 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 241 transitions, 570 flow [2025-03-14 01:51:05,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:05,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:05,622 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:05,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:51:05,622 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:05,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:05,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2033324350, now seen corresponding path program 1 times [2025-03-14 01:51:05,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:05,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935149250] [2025-03-14 01:51:05,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:05,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:05,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-14 01:51:05,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-14 01:51:05,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:05,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:05,734 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:05,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:05,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935149250] [2025-03-14 01:51:05,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935149250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:05,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:05,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:05,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714375169] [2025-03-14 01:51:05,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:05,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:05,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:05,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:05,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:05,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 231 [2025-03-14 01:51:05,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 241 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:05,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:05,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 231 [2025-03-14 01:51:05,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:05,860 INFO L124 PetriNetUnfolderBase]: 83/734 cut-off events. [2025-03-14 01:51:05,860 INFO L125 PetriNetUnfolderBase]: For 64/67 co-relation queries the response was YES. [2025-03-14 01:51:05,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 734 events. 83/734 cut-off events. For 64/67 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3732 event pairs, 45 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 838. Up to 114 conditions per place. [2025-03-14 01:51:05,865 INFO L140 encePairwiseOnDemand]: 227/231 looper letters, 17 selfloop transitions, 3 changer transitions 1/247 dead transitions. [2025-03-14 01:51:05,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 624 flow [2025-03-14 01:51:05,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2025-03-14 01:51:05,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581529581529582 [2025-03-14 01:51:05,867 INFO L175 Difference]: Start difference. First operand has 236 places, 241 transitions, 570 flow. Second operand 3 states and 664 transitions. [2025-03-14 01:51:05,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 624 flow [2025-03-14 01:51:05,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:05,873 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 578 flow [2025-03-14 01:51:05,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2025-03-14 01:51:05,875 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 7 predicate places. [2025-03-14 01:51:05,875 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 578 flow [2025-03-14 01:51:05,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:05,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:05,876 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:05,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:51:05,877 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:05,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:05,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1645553511, now seen corresponding path program 1 times [2025-03-14 01:51:05,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:05,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201837148] [2025-03-14 01:51:05,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:05,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:05,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-14 01:51:05,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-14 01:51:05,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:05,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:05,962 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:05,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:05,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201837148] [2025-03-14 01:51:05,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201837148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:05,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:05,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:05,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076371957] [2025-03-14 01:51:05,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:05,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:05,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:05,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:05,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:05,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2025-03-14 01:51:05,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:05,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:05,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2025-03-14 01:51:05,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:06,091 INFO L124 PetriNetUnfolderBase]: 92/747 cut-off events. [2025-03-14 01:51:06,091 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2025-03-14 01:51:06,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 747 events. 92/747 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3937 event pairs, 54 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 914. Up to 141 conditions per place. [2025-03-14 01:51:06,093 INFO L140 encePairwiseOnDemand]: 226/231 looper letters, 22 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2025-03-14 01:51:06,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 252 transitions, 654 flow [2025-03-14 01:51:06,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:06,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2025-03-14 01:51:06,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9567099567099567 [2025-03-14 01:51:06,096 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 578 flow. Second operand 3 states and 663 transitions. [2025-03-14 01:51:06,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 252 transitions, 654 flow [2025-03-14 01:51:06,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 252 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:06,101 INFO L231 Difference]: Finished difference. Result has 240 places, 246 transitions, 608 flow [2025-03-14 01:51:06,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=240, PETRI_TRANSITIONS=246} [2025-03-14 01:51:06,102 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 9 predicate places. [2025-03-14 01:51:06,102 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 246 transitions, 608 flow [2025-03-14 01:51:06,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:06,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:06,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] [2025-03-14 01:51:06,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:51:06,103 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:06,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:06,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1880517101, now seen corresponding path program 1 times [2025-03-14 01:51:06,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:06,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375977498] [2025-03-14 01:51:06,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:06,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:06,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-14 01:51:06,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-14 01:51:06,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:06,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:06,186 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:06,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:06,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375977498] [2025-03-14 01:51:06,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375977498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:06,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:06,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:06,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046060414] [2025-03-14 01:51:06,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:06,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:06,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:06,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:06,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:06,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 231 [2025-03-14 01:51:06,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 246 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:06,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:06,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 231 [2025-03-14 01:51:06,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:06,302 INFO L124 PetriNetUnfolderBase]: 159/927 cut-off events. [2025-03-14 01:51:06,303 INFO L125 PetriNetUnfolderBase]: For 211/217 co-relation queries the response was YES. [2025-03-14 01:51:06,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 927 events. 159/927 cut-off events. For 211/217 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5130 event pairs, 73 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1385. Up to 275 conditions per place. [2025-03-14 01:51:06,306 INFO L140 encePairwiseOnDemand]: 224/231 looper letters, 29 selfloop transitions, 11 changer transitions 4/259 dead transitions. [2025-03-14 01:51:06,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 259 transitions, 730 flow [2025-03-14 01:51:06,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:06,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2025-03-14 01:51:06,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950937950937951 [2025-03-14 01:51:06,308 INFO L175 Difference]: Start difference. First operand has 240 places, 246 transitions, 608 flow. Second operand 3 states and 659 transitions. [2025-03-14 01:51:06,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 259 transitions, 730 flow [2025-03-14 01:51:06,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 259 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:06,312 INFO L231 Difference]: Finished difference. Result has 242 places, 250 transitions, 674 flow [2025-03-14 01:51:06,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=242, PETRI_TRANSITIONS=250} [2025-03-14 01:51:06,314 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places. [2025-03-14 01:51:06,314 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 250 transitions, 674 flow [2025-03-14 01:51:06,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:06,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:06,314 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:06,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:51:06,314 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:06,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:06,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2131184810, now seen corresponding path program 1 times [2025-03-14 01:51:06,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:06,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077373414] [2025-03-14 01:51:06,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:06,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:06,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-14 01:51:06,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-14 01:51:06,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:06,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:51:06,375 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:51:06,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-14 01:51:06,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-14 01:51:06,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:06,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:51:06,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:51:06,484 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:51:06,484 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-14 01:51:06,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-14 01:51:06,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-14 01:51:06,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-14 01:51:06,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-14 01:51:06,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-14 01:51:06,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-14 01:51:06,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-14 01:51:06,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-14 01:51:06,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-14 01:51:06,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-14 01:51:06,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:51:06,486 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-14 01:51:06,488 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:51:06,488 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:51:06,514 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:51:06,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 261 transitions, 532 flow [2025-03-14 01:51:06,554 INFO L124 PetriNetUnfolderBase]: 7/351 cut-off events. [2025-03-14 01:51:06,554 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:51:06,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 351 events. 7/351 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 410 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 273. Up to 6 conditions per place. [2025-03-14 01:51:06,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 261 transitions, 532 flow [2025-03-14 01:51:06,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 261 transitions, 532 flow [2025-03-14 01:51:06,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:51:06,560 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;@627ba445, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:51:06,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-14 01:51:06,571 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:51:06,571 INFO L124 PetriNetUnfolderBase]: 1/160 cut-off events. [2025-03-14 01:51:06,571 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:51:06,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:06,572 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:06,572 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:06,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:06,572 INFO L85 PathProgramCache]: Analyzing trace with hash -970362923, now seen corresponding path program 1 times [2025-03-14 01:51:06,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:06,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278945462] [2025-03-14 01:51:06,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:06,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:06,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-14 01:51:06,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-14 01:51:06,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:06,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:06,640 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:06,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:06,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278945462] [2025-03-14 01:51:06,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278945462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:06,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:06,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:06,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858796374] [2025-03-14 01:51:06,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:06,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:06,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:06,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:06,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:06,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 261 [2025-03-14 01:51:06,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 261 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:06,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:06,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 261 [2025-03-14 01:51:06,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:07,392 INFO L124 PetriNetUnfolderBase]: 2216/6761 cut-off events. [2025-03-14 01:51:07,393 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-14 01:51:07,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 6761 events. 2216/6761 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 63719 event pairs, 879 based on Foata normal form. 1/6057 useless extension candidates. Maximal degree in co-relation 8872. Up to 2089 conditions per place. [2025-03-14 01:51:07,434 INFO L140 encePairwiseOnDemand]: 244/261 looper letters, 46 selfloop transitions, 11 changer transitions 1/285 dead transitions. [2025-03-14 01:51:07,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 285 transitions, 699 flow [2025-03-14 01:51:07,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2025-03-14 01:51:07,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9553001277139208 [2025-03-14 01:51:07,437 INFO L175 Difference]: Start difference. First operand has 263 places, 261 transitions, 532 flow. Second operand 3 states and 748 transitions. [2025-03-14 01:51:07,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 285 transitions, 699 flow [2025-03-14 01:51:07,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 285 transitions, 699 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:07,442 INFO L231 Difference]: Finished difference. Result has 267 places, 269 transitions, 622 flow [2025-03-14 01:51:07,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=267, PETRI_TRANSITIONS=269} [2025-03-14 01:51:07,444 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 4 predicate places. [2025-03-14 01:51:07,444 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 269 transitions, 622 flow [2025-03-14 01:51:07,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:07,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:07,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:51:07,446 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:07,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:07,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1488487324, now seen corresponding path program 1 times [2025-03-14 01:51:07,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:07,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090378047] [2025-03-14 01:51:07,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:07,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:07,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-14 01:51:07,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-14 01:51:07,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:07,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:07,556 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:07,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:07,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090378047] [2025-03-14 01:51:07,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090378047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:07,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:07,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:07,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156393611] [2025-03-14 01:51:07,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:07,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:07,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:07,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:07,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:07,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 261 [2025-03-14 01:51:07,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 269 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:07,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:07,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 261 [2025-03-14 01:51:07,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:08,607 INFO L124 PetriNetUnfolderBase]: 2480/8562 cut-off events. [2025-03-14 01:51:08,608 INFO L125 PetriNetUnfolderBase]: For 2802/2998 co-relation queries the response was YES. [2025-03-14 01:51:08,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15328 conditions, 8562 events. 2480/8562 cut-off events. For 2802/2998 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 87738 event pairs, 1597 based on Foata normal form. 70/7873 useless extension candidates. Maximal degree in co-relation 13171. Up to 3442 conditions per place. [2025-03-14 01:51:08,646 INFO L140 encePairwiseOnDemand]: 253/261 looper letters, 42 selfloop transitions, 12 changer transitions 0/287 dead transitions. [2025-03-14 01:51:08,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 287 transitions, 790 flow [2025-03-14 01:51:08,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2025-03-14 01:51:08,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9374201787994891 [2025-03-14 01:51:08,650 INFO L175 Difference]: Start difference. First operand has 267 places, 269 transitions, 622 flow. Second operand 3 states and 734 transitions. [2025-03-14 01:51:08,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 287 transitions, 790 flow [2025-03-14 01:51:08,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:08,663 INFO L231 Difference]: Finished difference. Result has 268 places, 279 transitions, 706 flow [2025-03-14 01:51:08,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=268, PETRI_TRANSITIONS=279} [2025-03-14 01:51:08,664 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 5 predicate places. [2025-03-14 01:51:08,664 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 279 transitions, 706 flow [2025-03-14 01:51:08,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:08,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:08,664 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:08,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:51:08,665 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:08,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:08,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2127201086, now seen corresponding path program 1 times [2025-03-14 01:51:08,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:08,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151854574] [2025-03-14 01:51:08,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:08,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:08,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-14 01:51:08,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-14 01:51:08,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:08,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:08,718 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:08,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:08,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151854574] [2025-03-14 01:51:08,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151854574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:08,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:08,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:08,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111747583] [2025-03-14 01:51:08,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:08,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:08,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:08,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:08,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:08,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 261 [2025-03-14 01:51:08,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 279 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:08,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:08,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 261 [2025-03-14 01:51:08,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:09,753 INFO L124 PetriNetUnfolderBase]: 1878/7688 cut-off events. [2025-03-14 01:51:09,754 INFO L125 PetriNetUnfolderBase]: For 1100/1917 co-relation queries the response was YES. [2025-03-14 01:51:09,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12618 conditions, 7688 events. 1878/7688 cut-off events. For 1100/1917 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 82677 event pairs, 1092 based on Foata normal form. 7/6759 useless extension candidates. Maximal degree in co-relation 10919. Up to 1725 conditions per place. [2025-03-14 01:51:09,808 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 28 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2025-03-14 01:51:09,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 290 transitions, 792 flow [2025-03-14 01:51:09,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:09,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2025-03-14 01:51:09,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540229885057471 [2025-03-14 01:51:09,811 INFO L175 Difference]: Start difference. First operand has 268 places, 279 transitions, 706 flow. Second operand 3 states and 747 transitions. [2025-03-14 01:51:09,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 290 transitions, 792 flow [2025-03-14 01:51:09,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 290 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:09,821 INFO L231 Difference]: Finished difference. Result has 270 places, 282 transitions, 712 flow [2025-03-14 01:51:09,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=270, PETRI_TRANSITIONS=282} [2025-03-14 01:51:09,823 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 7 predicate places. [2025-03-14 01:51:09,824 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 282 transitions, 712 flow [2025-03-14 01:51:09,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:09,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:09,825 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:09,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:51:09,825 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:09,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:09,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1438465553, now seen corresponding path program 1 times [2025-03-14 01:51:09,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:09,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503352358] [2025-03-14 01:51:09,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:09,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:09,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-14 01:51:09,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-14 01:51:09,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:09,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:09,894 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:09,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:09,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503352358] [2025-03-14 01:51:09,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503352358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:09,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:09,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:09,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112590753] [2025-03-14 01:51:09,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:09,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:09,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:09,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:09,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 261 [2025-03-14 01:51:09,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 282 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:09,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:09,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 261 [2025-03-14 01:51:09,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:10,897 INFO L124 PetriNetUnfolderBase]: 2430/9836 cut-off events. [2025-03-14 01:51:10,897 INFO L125 PetriNetUnfolderBase]: For 1611/2578 co-relation queries the response was YES. [2025-03-14 01:51:10,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16531 conditions, 9836 events. 2430/9836 cut-off events. For 1611/2578 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 113054 event pairs, 1418 based on Foata normal form. 11/8675 useless extension candidates. Maximal degree in co-relation 14739. Up to 2447 conditions per place. [2025-03-14 01:51:10,945 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 34 selfloop transitions, 7 changer transitions 0/298 dead transitions. [2025-03-14 01:51:10,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 298 transitions, 841 flow [2025-03-14 01:51:10,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:10,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2025-03-14 01:51:10,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540229885057471 [2025-03-14 01:51:10,947 INFO L175 Difference]: Start difference. First operand has 270 places, 282 transitions, 712 flow. Second operand 3 states and 747 transitions. [2025-03-14 01:51:10,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 298 transitions, 841 flow [2025-03-14 01:51:10,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 298 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:10,955 INFO L231 Difference]: Finished difference. Result has 272 places, 287 transitions, 760 flow [2025-03-14 01:51:10,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=272, PETRI_TRANSITIONS=287} [2025-03-14 01:51:10,956 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 9 predicate places. [2025-03-14 01:51:10,956 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 287 transitions, 760 flow [2025-03-14 01:51:10,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:10,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:10,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:10,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:51:10,957 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:10,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:10,958 INFO L85 PathProgramCache]: Analyzing trace with hash -440638411, now seen corresponding path program 1 times [2025-03-14 01:51:10,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:10,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694267601] [2025-03-14 01:51:10,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:10,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:10,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-14 01:51:10,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-14 01:51:10,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:10,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:11,095 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:11,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:11,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694267601] [2025-03-14 01:51:11,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694267601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:11,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:11,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:11,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673267897] [2025-03-14 01:51:11,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:11,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:11,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:11,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:11,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:11,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 261 [2025-03-14 01:51:11,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 287 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:11,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:11,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 261 [2025-03-14 01:51:11,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:12,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([697] 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][270], [281#true, 116#L695-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 262#true, 224#L695-5true, Black: 278#(= |#race~data~0| 0), 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2025-03-14 01:51:12,029 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-03-14 01:51:12,029 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:51:12,029 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 01:51:12,029 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 01:51:12,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([697] 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], [281#true, 260#L697-3true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 262#true, 224#L695-5true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-03-14 01:51:12,182 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-14 01:51:12,182 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:51:12,182 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:51:12,182 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:51:12,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([697] 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], [281#true, 40#L697true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 262#true, 224#L695-5true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-03-14 01:51:12,218 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-03-14 01:51:12,218 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-03-14 01:51:12,218 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-03-14 01:51:12,218 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:51:12,351 INFO L124 PetriNetUnfolderBase]: 4089/13244 cut-off events. [2025-03-14 01:51:12,351 INFO L125 PetriNetUnfolderBase]: For 5487/5811 co-relation queries the response was YES. [2025-03-14 01:51:12,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25628 conditions, 13244 events. 4089/13244 cut-off events. For 5487/5811 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 146268 event pairs, 2075 based on Foata normal form. 79/11927 useless extension candidates. Maximal degree in co-relation 21564. Up to 5204 conditions per place. [2025-03-14 01:51:12,402 INFO L140 encePairwiseOnDemand]: 252/261 looper letters, 49 selfloop transitions, 19 changer transitions 0/313 dead transitions. [2025-03-14 01:51:12,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 313 transitions, 997 flow [2025-03-14 01:51:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2025-03-14 01:51:12,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9476372924648787 [2025-03-14 01:51:12,404 INFO L175 Difference]: Start difference. First operand has 272 places, 287 transitions, 760 flow. Second operand 3 states and 742 transitions. [2025-03-14 01:51:12,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 313 transitions, 997 flow [2025-03-14 01:51:12,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 313 transitions, 983 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:12,412 INFO L231 Difference]: Finished difference. Result has 274 places, 302 transitions, 928 flow [2025-03-14 01:51:12,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=274, PETRI_TRANSITIONS=302} [2025-03-14 01:51:12,414 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2025-03-14 01:51:12,414 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 302 transitions, 928 flow [2025-03-14 01:51:12,414 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:12,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:12,414 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:12,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:51:12,415 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:12,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:12,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1266672474, now seen corresponding path program 1 times [2025-03-14 01:51:12,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:12,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726792302] [2025-03-14 01:51:12,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:12,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:12,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-14 01:51:12,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-14 01:51:12,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:12,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:12,680 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,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:12,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726792302] [2025-03-14 01:51:12,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726792302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:12,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:12,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:51:12,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016926701] [2025-03-14 01:51:12,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:12,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:51:12,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:12,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:51:12,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:51:12,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 261 [2025-03-14 01:51:12,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 302 transitions, 928 flow. Second operand has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:12,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:12,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 261 [2025-03-14 01:51:12,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:13,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([759] L705-3-->L705-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_5| |v_#race~threads_alive~0_6|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|, #race~threads_alive~0=|v_#race~threads_alive~0_6|} AuxVars[] AssignedVars[#race~threads_alive~0][273], [60#L705-1true, 116#L695-1true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 271#true, 291#true, 224#L695-5true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 268#(= |#race~threads_alive~0| 0), 264#true]) [2025-03-14 01:51:13,690 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-03-14 01:51:13,690 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:51:13,690 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:51:13,690 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:51:13,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([697] 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][276], [116#L695-1true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 291#true, 262#true, 224#L695-5true, Black: 278#(= |#race~data~0| 0), 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2025-03-14 01:51:13,720 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-03-14 01:51:13,723 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 01:51:13,723 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:51:13,723 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 01:51:13,796 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([697] 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][276], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 116#L695-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 61#L712-2true, 224#L695-5true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2025-03-14 01:51:13,796 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-03-14 01:51:13,796 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 01:51:13,796 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:51:13,796 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 01:51:13,796 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:51:13,804 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([697] 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][276], [116#L695-1true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 291#true, 224#L695-5true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-03-14 01:51:13,804 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-03-14 01:51:13,804 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 01:51:13,804 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:51:13,804 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:51:13,804 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 01:51:13,804 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:51:13,868 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([697] 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], [260#L697-3true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 61#L712-2true, 224#L695-5true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2025-03-14 01:51:13,868 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-14 01:51:13,868 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:51:13,868 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:51:13,868 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:51:13,879 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([697] 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][276], [116#L695-1true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 61#L712-2true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 6#L695-4true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-03-14 01:51:13,879 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-03-14 01:51:13,879 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:51:13,879 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-14 01:51:13,879 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:51:14,005 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([697] 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], [260#L697-3true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 61#L712-2true, 262#true, 224#L695-5true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-03-14 01:51:14,005 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-14 01:51:14,005 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:51:14,005 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:51:14,005 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:51:14,005 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:51:14,019 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([697] 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: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 291#true, 262#true, 224#L695-5true, Black: 278#(= |#race~data~0| 0), 286#true, 257#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-03-14 01:51:14,019 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-03-14 01:51:14,019 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 01:51:14,019 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:51:14,019 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:51:14,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([810] L695-5-->L695-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2)) InVars {~threads_alive~0=v_~threads_alive~0_7} OutVars{~threads_alive~0=v_~threads_alive~0_6} AuxVars[] AssignedVars[~threads_alive~0][290], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 28#L695-3true, 286#true, 234#L706true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, 219#L695-3true, Black: 266#true]) [2025-03-14 01:51:14,026 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-14 01:51:14,026 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:51:14,026 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:51:14,026 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:51:14,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([697] 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: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 291#true, 262#true, 224#L695-5true, Black: 278#(= |#race~data~0| 0), 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2025-03-14 01:51:14,078 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-03-14 01:51:14,078 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:51:14,078 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-03-14 01:51:14,078 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:51:14,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L695-2-->L695: Formula: (= |v_#race~threads_alive~0_12| |v_threadThread1of2ForFork0_#t~nondet5_3|) InVars {threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|} OutVars{threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|, #race~threads_alive~0=|v_#race~threads_alive~0_12|} AuxVars[] AssignedVars[#race~threads_alive~0][222], [Black: 286#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 291#true, 262#true, 224#L695-5true, Black: 278#(= |#race~data~0| 0), 238#L706-3true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 268#(= |#race~threads_alive~0| 0), 217#L695true]) [2025-03-14 01:51:14,090 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is not cut-off event [2025-03-14 01:51:14,090 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2025-03-14 01:51:14,090 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2025-03-14 01:51:14,090 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2025-03-14 01:51:14,383 INFO L124 PetriNetUnfolderBase]: 4737/15801 cut-off events. [2025-03-14 01:51:14,384 INFO L125 PetriNetUnfolderBase]: For 6550/7131 co-relation queries the response was YES. [2025-03-14 01:51:14,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31067 conditions, 15801 events. 4737/15801 cut-off events. For 6550/7131 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 184732 event pairs, 1712 based on Foata normal form. 71/14046 useless extension candidates. Maximal degree in co-relation 16596. Up to 4209 conditions per place. [2025-03-14 01:51:14,471 INFO L140 encePairwiseOnDemand]: 253/261 looper letters, 45 selfloop transitions, 9 changer transitions 2/332 dead transitions. [2025-03-14 01:51:14,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 332 transitions, 1100 flow [2025-03-14 01:51:14,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:51:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:51:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2025-03-14 01:51:14,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.929757343550447 [2025-03-14 01:51:14,475 INFO L175 Difference]: Start difference. First operand has 274 places, 302 transitions, 928 flow. Second operand 6 states and 1456 transitions. [2025-03-14 01:51:14,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 332 transitions, 1100 flow [2025-03-14 01:51:14,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 332 transitions, 1062 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:14,503 INFO L231 Difference]: Finished difference. Result has 279 places, 309 transitions, 941 flow [2025-03-14 01:51:14,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=279, PETRI_TRANSITIONS=309} [2025-03-14 01:51:14,503 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 16 predicate places. [2025-03-14 01:51:14,504 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 309 transitions, 941 flow [2025-03-14 01:51:14,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:14,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:14,504 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:14,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:51:14,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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:14,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1080948329, now seen corresponding path program 1 times [2025-03-14 01:51:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:14,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500978072] [2025-03-14 01:51:14,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:14,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:14,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-14 01:51:14,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-14 01:51:14,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:14,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:14,839 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,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:14,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500978072] [2025-03-14 01:51:14,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500978072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:14,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:14,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:51:14,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586179213] [2025-03-14 01:51:14,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:14,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:51:14,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:14,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:51:14,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:51:14,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 261 [2025-03-14 01:51:14,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 309 transitions, 941 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:14,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:14,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 261 [2025-03-14 01:51:14,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:15,398 INFO L124 PetriNetUnfolderBase]: 321/2651 cut-off events. [2025-03-14 01:51:15,399 INFO L125 PetriNetUnfolderBase]: For 665/701 co-relation queries the response was YES. [2025-03-14 01:51:15,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4680 conditions, 2651 events. 321/2651 cut-off events. For 665/701 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 22715 event pairs, 119 based on Foata normal form. 86/2586 useless extension candidates. Maximal degree in co-relation 4104. Up to 283 conditions per place. [2025-03-14 01:51:15,405 INFO L140 encePairwiseOnDemand]: 249/261 looper letters, 11 selfloop transitions, 12 changer transitions 0/275 dead transitions. [2025-03-14 01:51:15,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 275 transitions, 762 flow [2025-03-14 01:51:15,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:51:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:51:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1233 transitions. [2025-03-14 01:51:15,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9448275862068966 [2025-03-14 01:51:15,408 INFO L175 Difference]: Start difference. First operand has 279 places, 309 transitions, 941 flow. Second operand 5 states and 1233 transitions. [2025-03-14 01:51:15,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 275 transitions, 762 flow [2025-03-14 01:51:15,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 275 transitions, 716 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-03-14 01:51:15,415 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 679 flow [2025-03-14 01:51:15,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=679, PETRI_PLACES=273, PETRI_TRANSITIONS=270} [2025-03-14 01:51:15,416 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 10 predicate places. [2025-03-14 01:51:15,416 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 679 flow [2025-03-14 01:51:15,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:15,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:15,417 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:15,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:51:15,418 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:15,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:15,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2088305739, now seen corresponding path program 1 times [2025-03-14 01:51:15,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:15,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466515854] [2025-03-14 01:51:15,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:15,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:15,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-14 01:51:15,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-14 01:51:15,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:15,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:15,475 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:15,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:15,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466515854] [2025-03-14 01:51:15,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466515854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:15,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:15,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:15,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127561291] [2025-03-14 01:51:15,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:15,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:15,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:15,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:15,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:15,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 261 [2025-03-14 01:51:15,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:15,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:15,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 261 [2025-03-14 01:51:15,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:15,876 INFO L124 PetriNetUnfolderBase]: 1083/4561 cut-off events. [2025-03-14 01:51:15,877 INFO L125 PetriNetUnfolderBase]: For 1586/1598 co-relation queries the response was YES. [2025-03-14 01:51:15,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8766 conditions, 4561 events. 1083/4561 cut-off events. For 1586/1598 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 43897 event pairs, 573 based on Foata normal form. 0/4268 useless extension candidates. Maximal degree in co-relation 8187. Up to 1492 conditions per place. [2025-03-14 01:51:15,898 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 34 selfloop transitions, 10 changer transitions 0/286 dead transitions. [2025-03-14 01:51:15,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 286 transitions, 831 flow [2025-03-14 01:51:15,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:15,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2025-03-14 01:51:15,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527458492975734 [2025-03-14 01:51:15,900 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 679 flow. Second operand 3 states and 746 transitions. [2025-03-14 01:51:15,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 286 transitions, 831 flow [2025-03-14 01:51:15,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 286 transitions, 810 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:51:15,905 INFO L231 Difference]: Finished difference. Result has 274 places, 276 transitions, 748 flow [2025-03-14 01:51:15,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=274, PETRI_TRANSITIONS=276} [2025-03-14 01:51:15,907 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2025-03-14 01:51:15,907 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 276 transitions, 748 flow [2025-03-14 01:51:15,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:15,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:15,908 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:15,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:51:15,908 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:15,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:15,908 INFO L85 PathProgramCache]: Analyzing trace with hash 197914418, now seen corresponding path program 1 times [2025-03-14 01:51:15,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:15,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553551799] [2025-03-14 01:51:15,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:15,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:15,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-14 01:51:15,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-14 01:51:15,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:15,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:16,046 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,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:16,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553551799] [2025-03-14 01:51:16,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553551799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:16,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:16,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:51:16,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911282221] [2025-03-14 01:51:16,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:16,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:16,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:16,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:16,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:16,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 261 [2025-03-14 01:51:16,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 276 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:16,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:16,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 261 [2025-03-14 01:51:16,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:16,481 INFO L124 PetriNetUnfolderBase]: 646/4598 cut-off events. [2025-03-14 01:51:16,481 INFO L125 PetriNetUnfolderBase]: For 1815/1986 co-relation queries the response was YES. [2025-03-14 01:51:16,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8372 conditions, 4598 events. 646/4598 cut-off events. For 1815/1986 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 48718 event pairs, 112 based on Foata normal form. 15/4399 useless extension candidates. Maximal degree in co-relation 7189. Up to 698 conditions per place. [2025-03-14 01:51:16,506 INFO L140 encePairwiseOnDemand]: 252/261 looper letters, 21 selfloop transitions, 9 changer transitions 0/289 dead transitions. [2025-03-14 01:51:16,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 289 transitions, 849 flow [2025-03-14 01:51:16,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2025-03-14 01:51:16,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9680715197956578 [2025-03-14 01:51:16,508 INFO L175 Difference]: Start difference. First operand has 274 places, 276 transitions, 748 flow. Second operand 3 states and 758 transitions. [2025-03-14 01:51:16,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 289 transitions, 849 flow [2025-03-14 01:51:16,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 289 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:16,631 INFO L231 Difference]: Finished difference. Result has 275 places, 283 transitions, 788 flow [2025-03-14 01:51:16,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=275, PETRI_TRANSITIONS=283} [2025-03-14 01:51:16,632 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 12 predicate places. [2025-03-14 01:51:16,633 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 283 transitions, 788 flow [2025-03-14 01:51:16,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:16,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:16,633 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:16,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:51:16,633 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:16,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:16,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1671340082, now seen corresponding path program 2 times [2025-03-14 01:51:16,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:16,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906745416] [2025-03-14 01:51:16,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:51:16,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:16,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 1 equivalence classes. [2025-03-14 01:51:16,662 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:16,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:51:16,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:16,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:16,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906745416] [2025-03-14 01:51:16,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906745416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:16,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:16,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:51:16,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495074810] [2025-03-14 01:51:16,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:16,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:51:16,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:16,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:51:16,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:51:16,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 261 [2025-03-14 01:51:16,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 283 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:16,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:16,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 261 [2025-03-14 01:51:16,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:17,184 INFO L124 PetriNetUnfolderBase]: 302/2783 cut-off events. [2025-03-14 01:51:17,184 INFO L125 PetriNetUnfolderBase]: For 987/1190 co-relation queries the response was YES. [2025-03-14 01:51:17,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5096 conditions, 2783 events. 302/2783 cut-off events. For 987/1190 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 24945 event pairs, 83 based on Foata normal form. 61/2744 useless extension candidates. Maximal degree in co-relation 4430. Up to 326 conditions per place. [2025-03-14 01:51:17,196 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 28 selfloop transitions, 8 changer transitions 0/289 dead transitions. [2025-03-14 01:51:17,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 289 transitions, 867 flow [2025-03-14 01:51:17,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:51:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:51:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1236 transitions. [2025-03-14 01:51:17,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9471264367816092 [2025-03-14 01:51:17,198 INFO L175 Difference]: Start difference. First operand has 275 places, 283 transitions, 788 flow. Second operand 5 states and 1236 transitions. [2025-03-14 01:51:17,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 289 transitions, 867 flow [2025-03-14 01:51:17,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 289 transitions, 854 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:51:17,204 INFO L231 Difference]: Finished difference. Result has 278 places, 278 transitions, 751 flow [2025-03-14 01:51:17,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=751, PETRI_PLACES=278, PETRI_TRANSITIONS=278} [2025-03-14 01:51:17,205 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 15 predicate places. [2025-03-14 01:51:17,205 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 278 transitions, 751 flow [2025-03-14 01:51:17,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:17,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:17,206 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:17,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:51:17,206 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:17,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:17,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1064699311, now seen corresponding path program 1 times [2025-03-14 01:51:17,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:17,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953088569] [2025-03-14 01:51:17,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:17,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:17,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-14 01:51:17,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-14 01:51:17,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:17,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:17,256 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,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:17,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953088569] [2025-03-14 01:51:17,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953088569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:17,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:17,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:17,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955973647] [2025-03-14 01:51:17,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:17,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:17,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:17,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:17,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:17,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 261 [2025-03-14 01:51:17,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 278 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:17,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:17,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 261 [2025-03-14 01:51:17,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:17,566 INFO L124 PetriNetUnfolderBase]: 503/3564 cut-off events. [2025-03-14 01:51:17,567 INFO L125 PetriNetUnfolderBase]: For 2170/2436 co-relation queries the response was YES. [2025-03-14 01:51:17,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7138 conditions, 3564 events. 503/3564 cut-off events. For 2170/2436 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 34354 event pairs, 226 based on Foata normal form. 6/3415 useless extension candidates. Maximal degree in co-relation 6345. Up to 891 conditions per place. [2025-03-14 01:51:17,579 INFO L140 encePairwiseOnDemand]: 258/261 looper letters, 37 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-03-14 01:51:17,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 280 transitions, 845 flow [2025-03-14 01:51:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2025-03-14 01:51:17,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2025-03-14 01:51:17,580 INFO L175 Difference]: Start difference. First operand has 278 places, 278 transitions, 751 flow. Second operand 3 states and 725 transitions. [2025-03-14 01:51:17,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 280 transitions, 845 flow [2025-03-14 01:51:17,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 280 transitions, 833 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:51:17,585 INFO L231 Difference]: Finished difference. Result has 276 places, 277 transitions, 744 flow [2025-03-14 01:51:17,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=276, PETRI_TRANSITIONS=277} [2025-03-14 01:51:17,585 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 13 predicate places. [2025-03-14 01:51:17,585 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 277 transitions, 744 flow [2025-03-14 01:51:17,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:17,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:17,586 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:17,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:51:17,586 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:17,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:17,587 INFO L85 PathProgramCache]: Analyzing trace with hash -642065938, now seen corresponding path program 1 times [2025-03-14 01:51:17,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:17,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265776384] [2025-03-14 01:51:17,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:17,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:17,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-14 01:51:17,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-14 01:51:17,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:17,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:51:17,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:51:17,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-14 01:51:17,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-14 01:51:17,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:17,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:51:17,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:51:17,658 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:51:17,658 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-14 01:51:17,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-14 01:51:17,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-14 01:51:17,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-14 01:51:17,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-14 01:51:17,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-14 01:51:17,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-14 01:51:17,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-14 01:51:17,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-14 01:51:17,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-14 01:51:17,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-14 01:51:17,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-14 01:51:17,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-14 01:51:17,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-14 01:51:17,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:51:17,660 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:17,660 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:51:17,660 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 01:51:17,685 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:51:17,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 295 places, 291 transitions, 600 flow [2025-03-14 01:51:17,713 INFO L124 PetriNetUnfolderBase]: 9/430 cut-off events. [2025-03-14 01:51:17,713 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:51:17,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 430 events. 9/430 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 586 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 355. Up to 8 conditions per place. [2025-03-14 01:51:17,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 291 transitions, 600 flow [2025-03-14 01:51:17,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 291 transitions, 600 flow [2025-03-14 01:51:17,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:51:17,717 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;@627ba445, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:51:17,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-14 01:51:17,722 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:51:17,722 INFO L124 PetriNetUnfolderBase]: 1/160 cut-off events. [2025-03-14 01:51:17,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:51:17,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:17,723 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:17,723 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:17,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:17,724 INFO L85 PathProgramCache]: Analyzing trace with hash -532868939, now seen corresponding path program 1 times [2025-03-14 01:51:17,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:17,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663776807] [2025-03-14 01:51:17,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:17,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:17,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-14 01:51:17,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-14 01:51:17,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:17,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:17,764 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,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:17,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663776807] [2025-03-14 01:51:17,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663776807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:17,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:17,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:17,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050905723] [2025-03-14 01:51:17,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:17,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:17,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:17,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:17,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:17,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 291 [2025-03-14 01:51:17,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 291 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:17,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:17,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 291 [2025-03-14 01:51:17,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:25,671 INFO L124 PetriNetUnfolderBase]: 35239/79075 cut-off events. [2025-03-14 01:51:25,671 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2025-03-14 01:51:25,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129887 conditions, 79075 events. 35239/79075 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 2923. Compared 957737 event pairs, 14941 based on Foata normal form. 1/71001 useless extension candidates. Maximal degree in co-relation 109153. Up to 27933 conditions per place. [2025-03-14 01:51:26,085 INFO L140 encePairwiseOnDemand]: 270/291 looper letters, 60 selfloop transitions, 14 changer transitions 1/323 dead transitions. [2025-03-14 01:51:26,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 323 transitions, 824 flow [2025-03-14 01:51:26,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 829 transitions. [2025-03-14 01:51:26,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9495990836197021 [2025-03-14 01:51:26,087 INFO L175 Difference]: Start difference. First operand has 295 places, 291 transitions, 600 flow. Second operand 3 states and 829 transitions. [2025-03-14 01:51:26,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 323 transitions, 824 flow [2025-03-14 01:51:26,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 323 transitions, 820 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:26,092 INFO L231 Difference]: Finished difference. Result has 299 places, 302 transitions, 714 flow [2025-03-14 01:51:26,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=299, PETRI_TRANSITIONS=302} [2025-03-14 01:51:26,093 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, 4 predicate places. [2025-03-14 01:51:26,093 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 302 transitions, 714 flow [2025-03-14 01:51:26,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:26,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:26,094 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:26,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:51:26,094 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:26,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:26,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2000867303, now seen corresponding path program 1 times [2025-03-14 01:51:26,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:26,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364060907] [2025-03-14 01:51:26,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:26,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:26,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-14 01:51:26,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-14 01:51:26,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:26,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:26,130 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:26,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:26,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364060907] [2025-03-14 01:51:26,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364060907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:26,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:26,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:26,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667324856] [2025-03-14 01:51:26,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:26,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:26,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:26,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:26,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:26,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 291 [2025-03-14 01:51:26,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 302 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:26,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:26,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 291 [2025-03-14 01:51:26,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:29,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [61#L691true, 303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 149#L695-4true, 296#true, Black: 298#true]) [2025-03-14 01:51:29,920 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-03-14 01:51:29,920 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:29,920 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:29,920 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:29,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [61#L691true, 303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 46#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true]) [2025-03-14 01:51:29,920 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-03-14 01:51:29,920 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:51:29,920 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:51:29,920 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:51:29,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [61#L691true, 303#true, 292#true, 73#L712-2true, 294#true, 46#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 158#L695-4true]) [2025-03-14 01:51:29,920 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-03-14 01:51:29,920 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:29,920 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:29,920 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:30,270 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] 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], [61#L691true, 303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 149#L695-4true, 296#true, Black: 298#true]) [2025-03-14 01:51:30,270 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-03-14 01:51:30,270 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:30,270 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:30,270 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-03-14 01:51:30,270 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:30,272 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] 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], [61#L691true, 303#true, 292#true, 73#L712-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 46#L695-5true, 296#true, Black: 298#true, 158#L695-4true]) [2025-03-14 01:51:30,272 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-03-14 01:51:30,272 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-03-14 01:51:30,272 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:30,272 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:30,272 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:51:30,757 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] 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], [61#L691true, 303#true, 292#true, 73#L712-2true, 104#L695-5true, 294#true, 300#(= |#race~threads_alive~0| 0), 46#L695-5true, 296#true, Black: 298#true]) [2025-03-14 01:51:30,758 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-03-14 01:51:30,758 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:51:30,758 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:51:30,758 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:51:30,758 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-03-14 01:51:30,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [61#L691true, 303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-14 01:51:30,758 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-03-14 01:51:30,758 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-03-14 01:51:30,758 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:51:30,758 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:51:31,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [115#L695true, 61#L691true, 303#true, 292#true, 73#L712-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-14 01:51:31,584 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2025-03-14 01:51:31,584 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-03-14 01:51:31,584 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-03-14 01:51:31,584 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-03-14 01:51:31,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [61#L691true, 303#true, 292#true, 73#L712-2true, 145#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 159#L695true, Black: 298#true]) [2025-03-14 01:51:31,586 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2025-03-14 01:51:31,586 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-03-14 01:51:31,586 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-03-14 01:51:31,586 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-03-14 01:51:32,223 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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, 61#L691true, 303#true, 292#true, 73#L712-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-14 01:51:32,223 INFO L294 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2025-03-14 01:51:32,223 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2025-03-14 01:51:32,223 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2025-03-14 01:51:32,224 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:32,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [61#L691true, 303#true, 292#true, 73#L712-2true, 145#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 294#true, 276#L697true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true]) [2025-03-14 01:51:32,225 INFO L294 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2025-03-14 01:51:32,225 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2025-03-14 01:51:32,225 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2025-03-14 01:51:32,225 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:32,851 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 243#L693true, 300#(= |#race~threads_alive~0| 0), 149#L695-4true, 296#true, Black: 298#true]) [2025-03-14 01:51:32,851 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-03-14 01:51:32,851 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:32,851 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:32,851 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:32,851 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 243#L693true, 46#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true]) [2025-03-14 01:51:32,851 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-03-14 01:51:32,851 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-14 01:51:32,852 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-14 01:51:32,852 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-14 01:51:32,852 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [303#true, 292#true, 73#L712-2true, 294#true, 243#L693true, 46#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 158#L695-4true]) [2025-03-14 01:51:32,852 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-03-14 01:51:32,852 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:32,852 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:32,852 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:33,063 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] 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], [303#true, 292#true, 73#L712-2true, 104#L695-5true, 294#true, 243#L693true, 300#(= |#race~threads_alive~0| 0), 296#true, 149#L695-4true, Black: 298#true]) [2025-03-14 01:51:33,064 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-03-14 01:51:33,064 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:33,064 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:33,064 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-03-14 01:51:33,064 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:33,065 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] 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], [303#true, 292#true, 73#L712-2true, 243#L693true, 294#true, 300#(= |#race~threads_alive~0| 0), 46#L695-5true, 296#true, Black: 298#true, 158#L695-4true]) [2025-03-14 01:51:33,066 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-03-14 01:51:33,066 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:33,066 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:33,066 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-03-14 01:51:33,066 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-14 01:51:33,291 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] 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], [303#true, 292#true, 73#L712-2true, 104#L695-5true, 294#true, 243#L693true, 300#(= |#race~threads_alive~0| 0), 46#L695-5true, 296#true, Black: 298#true]) [2025-03-14 01:51:33,291 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-03-14 01:51:33,291 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-03-14 01:51:33,291 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-14 01:51:33,291 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-14 01:51:33,291 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-14 01:51:33,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 243#L693true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-14 01:51:33,291 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-03-14 01:51:33,291 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-14 01:51:33,291 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-03-14 01:51:33,291 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-14 01:51:33,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 198#L694true, 300#(= |#race~threads_alive~0| 0), 149#L695-4true, 296#true, Black: 298#true]) [2025-03-14 01:51:33,293 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-03-14 01:51:33,293 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:33,293 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:33,293 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:33,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 198#L694true, 46#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true]) [2025-03-14 01:51:33,293 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-14 01:51:33,293 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-14 01:51:33,293 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-14 01:51:33,293 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-14 01:51:33,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [303#true, 292#true, 73#L712-2true, 294#true, 198#L694true, 46#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 158#L695-4true]) [2025-03-14 01:51:33,293 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-03-14 01:51:33,294 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:33,294 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:33,294 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:33,512 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] 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], [303#true, 292#true, 73#L712-2true, 104#L695-5true, 294#true, 300#(= |#race~threads_alive~0| 0), 198#L694true, 296#true, 149#L695-4true, Black: 298#true]) [2025-03-14 01:51:33,513 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-03-14 01:51:33,513 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:33,513 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:33,513 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-14 01:51:33,513 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:33,514 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] 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], [303#true, 292#true, 73#L712-2true, 294#true, 198#L694true, 300#(= |#race~threads_alive~0| 0), 46#L695-5true, 296#true, Black: 298#true, 158#L695-4true]) [2025-03-14 01:51:33,514 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-03-14 01:51:33,514 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:33,515 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:33,515 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-14 01:51:33,515 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-14 01:51:34,002 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] 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], [303#true, 292#true, 73#L712-2true, 104#L695-5true, 294#true, 46#L695-5true, 300#(= |#race~threads_alive~0| 0), 198#L694true, 296#true, Black: 298#true]) [2025-03-14 01:51:34,002 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-14 01:51:34,002 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-14 01:51:34,002 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-14 01:51:34,002 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-14 01:51:34,002 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-14 01:51:34,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [303#true, 292#true, 73#L712-2true, 104#L695-5true, 294#true, 198#L694true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-14 01:51:34,003 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-14 01:51:34,003 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-14 01:51:34,003 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-14 01:51:34,003 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-14 01:51:34,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [115#L695true, 303#true, 292#true, 73#L712-2true, 294#true, 243#L693true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-14 01:51:34,351 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2025-03-14 01:51:34,351 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-03-14 01:51:34,351 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-03-14 01:51:34,351 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-14 01:51:34,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [303#true, 292#true, 73#L712-2true, 145#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 243#L693true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 159#L695true, Black: 298#true]) [2025-03-14 01:51:34,354 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2025-03-14 01:51:34,354 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-14 01:51:34,354 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-03-14 01:51:34,355 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-03-14 01:51:35,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [115#L695true, 303#true, 292#true, 73#L712-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 198#L694true, 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-14 01:51:35,183 INFO L294 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2025-03-14 01:51:35,183 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-03-14 01:51:35,183 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-03-14 01:51:35,183 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-03-14 01:51:35,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [303#true, 292#true, 73#L712-2true, 145#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 294#true, 300#(= |#race~threads_alive~0| 0), 198#L694true, 296#true, 159#L695true, Black: 298#true]) [2025-03-14 01:51:35,187 INFO L294 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2025-03-14 01:51:35,187 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-03-14 01:51:35,187 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-03-14 01:51:35,187 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-03-14 01:51:35,413 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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, 303#true, 292#true, 73#L712-2true, 294#true, 243#L693true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-14 01:51:35,413 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2025-03-14 01:51:35,413 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-14 01:51:35,413 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-14 01:51:35,413 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-03-14 01:51:35,416 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [303#true, 292#true, 145#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 73#L712-2true, 243#L693true, 294#true, 276#L697true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true]) [2025-03-14 01:51:35,416 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2025-03-14 01:51:35,416 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-14 01:51:35,416 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-14 01:51:35,417 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-03-14 01:51:35,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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, 303#true, 292#true, 73#L712-2true, 294#true, 198#L694true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-14 01:51:35,843 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2025-03-14 01:51:35,843 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-14 01:51:35,843 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-14 01:51:35,843 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-03-14 01:51:35,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [303#true, 292#true, 145#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 73#L712-2true, 294#true, 276#L697true, 300#(= |#race~threads_alive~0| 0), 198#L694true, 296#true, Black: 298#true]) [2025-03-14 01:51:35,848 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2025-03-14 01:51:35,848 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-03-14 01:51:35,848 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-14 01:51:35,848 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-14 01:51:37,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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, 156#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 303#true, 292#true, 73#L712-2true, 294#true, 276#L697true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true]) [2025-03-14 01:51:37,046 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2025-03-14 01:51:37,046 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-03-14 01:51:37,046 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-03-14 01:51:37,046 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-03-14 01:51:37,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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, 124#L697true, 303#true, 292#true, 73#L712-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-14 01:51:37,046 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2025-03-14 01:51:37,046 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-03-14 01:51:37,046 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-03-14 01:51:37,046 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-03-14 01:51:37,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [124#L697true, 303#true, 292#true, 145#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 73#L712-2true, 294#true, 276#L697true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true]) [2025-03-14 01:51:37,049 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2025-03-14 01:51:37,049 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-03-14 01:51:37,049 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-03-14 01:51:37,049 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-03-14 01:51:37,178 INFO L124 PetriNetUnfolderBase]: 38618/99725 cut-off events. [2025-03-14 01:51:37,179 INFO L125 PetriNetUnfolderBase]: For 40494/44758 co-relation queries the response was YES. [2025-03-14 01:51:37,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192268 conditions, 99725 events. 38618/99725 cut-off events. For 40494/44758 co-relation queries the response was YES. Maximal size of possible extension queue 3203. Compared 1335213 event pairs, 24930 based on Foata normal form. 654/90669 useless extension candidates. Maximal degree in co-relation 190021. Up to 46398 conditions per place. [2025-03-14 01:51:37,969 INFO L140 encePairwiseOnDemand]: 281/291 looper letters, 55 selfloop transitions, 16 changer transitions 0/328 dead transitions. [2025-03-14 01:51:37,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 328 transitions, 944 flow [2025-03-14 01:51:37,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:37,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2025-03-14 01:51:37,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9347079037800687 [2025-03-14 01:51:37,971 INFO L175 Difference]: Start difference. First operand has 299 places, 302 transitions, 714 flow. Second operand 3 states and 816 transitions. [2025-03-14 01:51:37,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 328 transitions, 944 flow [2025-03-14 01:51:38,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 328 transitions, 904 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:38,114 INFO L231 Difference]: Finished difference. Result has 300 places, 316 transitions, 832 flow [2025-03-14 01:51:38,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=300, PETRI_TRANSITIONS=316} [2025-03-14 01:51:38,114 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, 5 predicate places. [2025-03-14 01:51:38,114 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 316 transitions, 832 flow [2025-03-14 01:51:38,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:38,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:38,115 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:38,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:51:38,115 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:38,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:38,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1371954882, now seen corresponding path program 1 times [2025-03-14 01:51:38,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:38,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998377393] [2025-03-14 01:51:38,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:38,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:38,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-14 01:51:38,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-14 01:51:38,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:38,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:38,148 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:38,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:38,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998377393] [2025-03-14 01:51:38,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998377393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:38,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:38,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:38,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815427851] [2025-03-14 01:51:38,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:38,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:38,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:38,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:38,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:38,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 291 [2025-03-14 01:51:38,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 316 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:38,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:38,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 291 [2025-03-14 01:51:38,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:41,826 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [308#true, Black: 305#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 292#true, 303#true, 73#L712-2true, 104#L695-5true, 294#true, 149#L695-4true, 234#threadENTRYtrue, 296#true, Black: 298#true]) [2025-03-14 01:51:41,826 INFO L294 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2025-03-14 01:51:41,826 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:51:41,826 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:51:41,826 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:51:41,827 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [308#true, Black: 305#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 292#true, 303#true, 73#L712-2true, 294#true, 46#L695-5true, 234#threadENTRYtrue, 296#true, Black: 298#true, 158#L695-4true]) [2025-03-14 01:51:41,827 INFO L294 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2025-03-14 01:51:41,827 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:51:41,827 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:51:41,827 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:51:42,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] 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], [308#true, Black: 305#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 292#true, 303#true, 73#L712-2true, 104#L695-5true, 294#true, 46#L695-5true, 234#threadENTRYtrue, 296#true, Black: 298#true]) [2025-03-14 01:51:42,018 INFO L294 olderBase$Statistics]: this new event has 274 ancestors and is cut-off event [2025-03-14 01:51:42,019 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-14 01:51:42,019 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-14 01:51:42,019 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event