./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 446ad788bb04ab307771e8b8b2d959cead97e99c160d020f0d1d03b043f9ed25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:36:18,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:36:19,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:36:19,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:36:19,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:36:19,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:36:19,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:36:19,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:36:19,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:36:19,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:36:19,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:36:19,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:36:19,058 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:36:19,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:36:19,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:36:19,058 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:36:19,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:36:19,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:36:19,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:36:19,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:36:19,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:36:19,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:36:19,059 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:36:19,059 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:36:19,059 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:36:19,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:36:19,059 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:36:19,059 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:36:19,059 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:36:19,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:36:19,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:36:19,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:36:19,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:36:19,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:36:19,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:36:19,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:36:19,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:36:19,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:36:19,061 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:36:19,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:36:19,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:36:19,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:36:19,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:36:19,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:36:19,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:36:19,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:36:19,061 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-jdk21/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 -> 446ad788bb04ab307771e8b8b2d959cead97e99c160d020f0d1d03b043f9ed25 [2025-01-09 21:36:19,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:36:19,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:36:19,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:36:19,284 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:36:19,284 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:36:19,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i [2025-01-09 21:36:20,424 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43f99689d/79c591ea637d444d8a3bee87bdacf9ca/FLAGf888f8bee [2025-01-09 21:36:20,723 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:36:20,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i [2025-01-09 21:36:20,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43f99689d/79c591ea637d444d8a3bee87bdacf9ca/FLAGf888f8bee [2025-01-09 21:36:21,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43f99689d/79c591ea637d444d8a3bee87bdacf9ca [2025-01-09 21:36:21,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:36:21,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:36:21,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:36:21,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:36:21,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:36:21,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:36:21" (1/1) ... [2025-01-09 21:36:21,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30be30f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:21, skipping insertion in model container [2025-01-09 21:36:21,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:36:21" (1/1) ... [2025-01-09 21:36:21,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:36:21,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:36:21,426 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:36:21,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:36:21,510 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:36:21,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:21 WrapperNode [2025-01-09 21:36:21,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:36:21,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:36:21,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:36:21,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:36:21,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:21" (1/1) ... [2025-01-09 21:36:21,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:21" (1/1) ... [2025-01-09 21:36:21,542 INFO L138 Inliner]: procedures = 267, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 265 [2025-01-09 21:36:21,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:36:21,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:36:21,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:36:21,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:36:21,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:21" (1/1) ... [2025-01-09 21:36:21,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:21" (1/1) ... [2025-01-09 21:36:21,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:21" (1/1) ... [2025-01-09 21:36:21,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:21" (1/1) ... [2025-01-09 21:36:21,560 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:21" (1/1) ... [2025-01-09 21:36:21,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:21" (1/1) ... [2025-01-09 21:36:21,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:21" (1/1) ... [2025-01-09 21:36:21,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:21" (1/1) ... [2025-01-09 21:36:21,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:21" (1/1) ... [2025-01-09 21:36:21,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:36:21,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:36:21,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:36:21,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:36:21,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:21" (1/1) ... [2025-01-09 21:36:21,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:36:21,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:36:21,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:36:21,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:36:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:36:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:36:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:36:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:36:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:36:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:36:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:36:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2025-01-09 21:36:21,617 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2025-01-09 21:36:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:36:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-09 21:36:21,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-09 21:36:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:36:21,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:36:21,618 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:36:21,732 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:36:21,733 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:36:22,023 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:36:22,023 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:36:22,062 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:36:22,066 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-09 21:36:22,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:36:22 BoogieIcfgContainer [2025-01-09 21:36:22,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:36:22,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:36:22,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:36:22,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:36:22,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:36:21" (1/3) ... [2025-01-09 21:36:22,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc1ac11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:36:22, skipping insertion in model container [2025-01-09 21:36:22,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:21" (2/3) ... [2025-01-09 21:36:22,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc1ac11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:36:22, skipping insertion in model container [2025-01-09 21:36:22,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:36:22" (3/3) ... [2025-01-09 21:36:22,078 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter.i [2025-01-09 21:36:22,087 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:36:22,088 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-join-counter.i that has 3 procedures, 386 locations, 1 initial locations, 5 loop locations, and 34 error locations. [2025-01-09 21:36:22,088 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:36:22,169 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:36:22,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 460 places, 467 transitions, 948 flow [2025-01-09 21:36:22,456 INFO L124 PetriNetUnfolderBase]: 19/586 cut-off events. [2025-01-09 21:36:22,459 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:36:22,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 586 events. 19/586 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 906 event pairs, 0 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 374. Up to 6 conditions per place. [2025-01-09 21:36:22,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 460 places, 467 transitions, 948 flow [2025-01-09 21:36:22,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 391 places, 395 transitions, 800 flow [2025-01-09 21:36:22,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:36:22,500 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;@4b8e5645, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:36:22,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-01-09 21:36:22,515 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:36:22,518 INFO L124 PetriNetUnfolderBase]: 0/147 cut-off events. [2025-01-09 21:36:22,518 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:36:22,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:22,518 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] [2025-01-09 21:36:22,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:22,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:22,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2108841411, now seen corresponding path program 1 times [2025-01-09 21:36:22,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:22,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968919933] [2025-01-09 21:36:22,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:22,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:22,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 21:36:22,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 21:36:22,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:22,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:22,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:22,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968919933] [2025-01-09 21:36:22,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968919933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:22,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:22,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:22,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195879054] [2025-01-09 21:36:22,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:22,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:22,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:22,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:22,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:22,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 467 [2025-01-09 21:36:22,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 395 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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-01-09 21:36:22,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:22,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 467 [2025-01-09 21:36:22,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:23,649 INFO L124 PetriNetUnfolderBase]: 654/4276 cut-off events. [2025-01-09 21:36:23,649 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-09 21:36:23,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5312 conditions, 4276 events. 654/4276 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 33102 event pairs, 489 based on Foata normal form. 182/3762 useless extension candidates. Maximal degree in co-relation 5080. Up to 1006 conditions per place. [2025-01-09 21:36:23,678 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 28 selfloop transitions, 2 changer transitions 1/386 dead transitions. [2025-01-09 21:36:23,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 386 transitions, 842 flow [2025-01-09 21:36:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:23,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2025-01-09 21:36:23,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9300499643112062 [2025-01-09 21:36:23,697 INFO L175 Difference]: Start difference. First operand has 391 places, 395 transitions, 800 flow. Second operand 3 states and 1303 transitions. [2025-01-09 21:36:23,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 386 transitions, 842 flow [2025-01-09 21:36:23,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 386 transitions, 841 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:36:23,710 INFO L231 Difference]: Finished difference. Result has 388 places, 385 transitions, 783 flow [2025-01-09 21:36:23,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=388, PETRI_TRANSITIONS=385} [2025-01-09 21:36:23,717 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -3 predicate places. [2025-01-09 21:36:23,717 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 385 transitions, 783 flow [2025-01-09 21:36:23,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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-01-09 21:36:23,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:23,720 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] [2025-01-09 21:36:23,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:36:23,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:23,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:23,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2092754096, now seen corresponding path program 1 times [2025-01-09 21:36:23,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:23,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275694725] [2025-01-09 21:36:23,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:23,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:23,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 21:36:23,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 21:36:23,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:23,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:23,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:23,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275694725] [2025-01-09 21:36:23,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275694725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:23,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:23,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:23,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778837660] [2025-01-09 21:36:23,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:23,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:23,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:23,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:23,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:23,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 467 [2025-01-09 21:36:23,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 385 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 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-01-09 21:36:23,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:23,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 467 [2025-01-09 21:36:23,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:24,439 INFO L124 PetriNetUnfolderBase]: 760/4471 cut-off events. [2025-01-09 21:36:24,440 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-09 21:36:24,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5685 conditions, 4471 events. 760/4471 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 34848 event pairs, 564 based on Foata normal form. 0/3819 useless extension candidates. Maximal degree in co-relation 5528. Up to 1180 conditions per place. [2025-01-09 21:36:24,459 INFO L140 encePairwiseOnDemand]: 459/467 looper letters, 31 selfloop transitions, 1 changer transitions 0/378 dead transitions. [2025-01-09 21:36:24,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 378 transitions, 833 flow [2025-01-09 21:36:24,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-01-09 21:36:24,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9100642398286938 [2025-01-09 21:36:24,464 INFO L175 Difference]: Start difference. First operand has 388 places, 385 transitions, 783 flow. Second operand 3 states and 1275 transitions. [2025-01-09 21:36:24,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 378 transitions, 833 flow [2025-01-09 21:36:24,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 378 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:24,470 INFO L231 Difference]: Finished difference. Result has 380 places, 378 transitions, 767 flow [2025-01-09 21:36:24,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=380, PETRI_TRANSITIONS=378} [2025-01-09 21:36:24,471 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -11 predicate places. [2025-01-09 21:36:24,471 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 378 transitions, 767 flow [2025-01-09 21:36:24,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 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-01-09 21:36:24,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:24,472 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] [2025-01-09 21:36:24,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:36:24,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:24,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:24,475 INFO L85 PathProgramCache]: Analyzing trace with hash -404228134, now seen corresponding path program 1 times [2025-01-09 21:36:24,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:24,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678996146] [2025-01-09 21:36:24,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:24,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:24,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 21:36:24,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 21:36:24,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:24,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:24,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:24,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678996146] [2025-01-09 21:36:24,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678996146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:24,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:24,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:24,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504588435] [2025-01-09 21:36:24,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:24,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:24,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:24,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:24,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:24,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 467 [2025-01-09 21:36:24,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 378 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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-01-09 21:36:24,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:24,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 467 [2025-01-09 21:36:24,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:25,153 INFO L124 PetriNetUnfolderBase]: 725/4655 cut-off events. [2025-01-09 21:36:25,153 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-01-09 21:36:25,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5798 conditions, 4655 events. 725/4655 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 37766 event pairs, 548 based on Foata normal form. 0/3944 useless extension candidates. Maximal degree in co-relation 5641. Up to 1111 conditions per place. [2025-01-09 21:36:25,179 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 24 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2025-01-09 21:36:25,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 377 transitions, 817 flow [2025-01-09 21:36:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:25,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1305 transitions. [2025-01-09 21:36:25,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9314775160599572 [2025-01-09 21:36:25,183 INFO L175 Difference]: Start difference. First operand has 380 places, 378 transitions, 767 flow. Second operand 3 states and 1305 transitions. [2025-01-09 21:36:25,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 377 transitions, 817 flow [2025-01-09 21:36:25,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 377 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:36:25,189 INFO L231 Difference]: Finished difference. Result has 380 places, 377 transitions, 768 flow [2025-01-09 21:36:25,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=380, PETRI_TRANSITIONS=377} [2025-01-09 21:36:25,190 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -11 predicate places. [2025-01-09 21:36:25,191 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 377 transitions, 768 flow [2025-01-09 21:36:25,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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-01-09 21:36:25,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:25,191 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-01-09 21:36:25,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:36:25,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:25,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash -357020463, now seen corresponding path program 1 times [2025-01-09 21:36:25,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:25,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967357857] [2025-01-09 21:36:25,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:25,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:25,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 21:36:25,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 21:36:25,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:25,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:25,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:25,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:25,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967357857] [2025-01-09 21:36:25,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967357857] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:25,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:25,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:25,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780892197] [2025-01-09 21:36:25,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:25,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:25,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:25,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:25,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:25,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 467 [2025-01-09 21:36:25,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 377 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 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-01-09 21:36:25,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:25,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 467 [2025-01-09 21:36:25,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:25,968 INFO L124 PetriNetUnfolderBase]: 849/4491 cut-off events. [2025-01-09 21:36:25,968 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-09 21:36:25,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5798 conditions, 4491 events. 849/4491 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 34762 event pairs, 607 based on Foata normal form. 0/3824 useless extension candidates. Maximal degree in co-relation 5641. Up to 1267 conditions per place. [2025-01-09 21:36:25,982 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 24 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-01-09 21:36:25,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 376 transitions, 818 flow [2025-01-09 21:36:25,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1302 transitions. [2025-01-09 21:36:25,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9293361884368309 [2025-01-09 21:36:25,985 INFO L175 Difference]: Start difference. First operand has 380 places, 377 transitions, 768 flow. Second operand 3 states and 1302 transitions. [2025-01-09 21:36:25,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 376 transitions, 818 flow [2025-01-09 21:36:25,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 376 transitions, 814 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:25,989 INFO L231 Difference]: Finished difference. Result has 379 places, 376 transitions, 766 flow [2025-01-09 21:36:25,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=379, PETRI_TRANSITIONS=376} [2025-01-09 21:36:25,990 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -12 predicate places. [2025-01-09 21:36:25,990 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 376 transitions, 766 flow [2025-01-09 21:36:25,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 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-01-09 21:36:25,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:25,991 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] [2025-01-09 21:36:25,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:36:25,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:25,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1438810501, now seen corresponding path program 1 times [2025-01-09 21:36:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:25,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863679113] [2025-01-09 21:36:25,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:26,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 21:36:26,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 21:36:26,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:26,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:26,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:26,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863679113] [2025-01-09 21:36:26,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863679113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:26,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:26,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:26,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604680937] [2025-01-09 21:36:26,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:26,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:26,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:26,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:26,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:26,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 467 [2025-01-09 21:36:26,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 376 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 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-01-09 21:36:26,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:26,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 467 [2025-01-09 21:36:26,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:26,563 INFO L124 PetriNetUnfolderBase]: 991/4610 cut-off events. [2025-01-09 21:36:26,563 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-09 21:36:26,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6127 conditions, 4610 events. 991/4610 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 36125 event pairs, 713 based on Foata normal form. 0/3941 useless extension candidates. Maximal degree in co-relation 5970. Up to 1475 conditions per place. [2025-01-09 21:36:26,579 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 26 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-01-09 21:36:26,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 375 transitions, 820 flow [2025-01-09 21:36:26,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2025-01-09 21:36:26,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926481084939329 [2025-01-09 21:36:26,582 INFO L175 Difference]: Start difference. First operand has 379 places, 376 transitions, 766 flow. Second operand 3 states and 1298 transitions. [2025-01-09 21:36:26,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 375 transitions, 820 flow [2025-01-09 21:36:26,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 375 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:26,586 INFO L231 Difference]: Finished difference. Result has 378 places, 375 transitions, 764 flow [2025-01-09 21:36:26,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=378, PETRI_TRANSITIONS=375} [2025-01-09 21:36:26,589 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -13 predicate places. [2025-01-09 21:36:26,590 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 375 transitions, 764 flow [2025-01-09 21:36:26,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 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-01-09 21:36:26,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:26,591 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] [2025-01-09 21:36:26,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:36:26,591 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:26,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:26,592 INFO L85 PathProgramCache]: Analyzing trace with hash -12642578, now seen corresponding path program 1 times [2025-01-09 21:36:26,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:26,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240430416] [2025-01-09 21:36:26,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:26,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:26,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 21:36:26,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 21:36:26,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:26,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:26,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:26,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240430416] [2025-01-09 21:36:26,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240430416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:26,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:26,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:26,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486606870] [2025-01-09 21:36:26,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:26,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:26,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:26,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:26,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:26,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 467 [2025-01-09 21:36:26,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 375 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 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-01-09 21:36:26,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:26,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 467 [2025-01-09 21:36:26,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:27,142 INFO L124 PetriNetUnfolderBase]: 1451/5118 cut-off events. [2025-01-09 21:36:27,142 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-01-09 21:36:27,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7312 conditions, 5118 events. 1451/5118 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 39135 event pairs, 507 based on Foata normal form. 0/4530 useless extension candidates. Maximal degree in co-relation 7156. Up to 2100 conditions per place. [2025-01-09 21:36:27,161 INFO L140 encePairwiseOnDemand]: 459/467 looper letters, 38 selfloop transitions, 3 changer transitions 0/383 dead transitions. [2025-01-09 21:36:27,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 383 transitions, 867 flow [2025-01-09 21:36:27,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2025-01-09 21:36:27,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9214846538187009 [2025-01-09 21:36:27,165 INFO L175 Difference]: Start difference. First operand has 378 places, 375 transitions, 764 flow. Second operand 3 states and 1291 transitions. [2025-01-09 21:36:27,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 383 transitions, 867 flow [2025-01-09 21:36:27,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 383 transitions, 863 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:27,170 INFO L231 Difference]: Finished difference. Result has 374 places, 373 transitions, 771 flow [2025-01-09 21:36:27,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=374, PETRI_TRANSITIONS=373} [2025-01-09 21:36:27,172 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -17 predicate places. [2025-01-09 21:36:27,173 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 373 transitions, 771 flow [2025-01-09 21:36:27,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 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-01-09 21:36:27,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:27,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:27,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:36:27,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:27,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1660382984, now seen corresponding path program 1 times [2025-01-09 21:36:27,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:27,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950430738] [2025-01-09 21:36:27,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:27,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:27,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 21:36:27,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 21:36:27,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:27,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:27,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:27,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950430738] [2025-01-09 21:36:27,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950430738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:27,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:27,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:27,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067658385] [2025-01-09 21:36:27,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:27,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:27,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:27,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:27,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:27,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 467 [2025-01-09 21:36:27,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 373 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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-01-09 21:36:27,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:27,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 467 [2025-01-09 21:36:27,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:27,876 INFO L124 PetriNetUnfolderBase]: 971/5688 cut-off events. [2025-01-09 21:36:27,876 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-01-09 21:36:27,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7384 conditions, 5688 events. 971/5688 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 49213 event pairs, 625 based on Foata normal form. 0/5048 useless extension candidates. Maximal degree in co-relation 7228. Up to 1488 conditions per place. [2025-01-09 21:36:27,905 INFO L140 encePairwiseOnDemand]: 461/467 looper letters, 30 selfloop transitions, 3 changer transitions 0/379 dead transitions. [2025-01-09 21:36:27,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 379 transitions, 849 flow [2025-01-09 21:36:27,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2025-01-09 21:36:27,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9336188436830836 [2025-01-09 21:36:27,910 INFO L175 Difference]: Start difference. First operand has 374 places, 373 transitions, 771 flow. Second operand 3 states and 1308 transitions. [2025-01-09 21:36:27,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 379 transitions, 849 flow [2025-01-09 21:36:27,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 379 transitions, 849 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:27,915 INFO L231 Difference]: Finished difference. Result has 374 places, 373 transitions, 786 flow [2025-01-09 21:36:27,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=374, PETRI_TRANSITIONS=373} [2025-01-09 21:36:27,917 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -17 predicate places. [2025-01-09 21:36:27,918 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 373 transitions, 786 flow [2025-01-09 21:36:27,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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-01-09 21:36:27,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:27,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:27,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:36:27,919 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:27,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:27,919 INFO L85 PathProgramCache]: Analyzing trace with hash 39763656, now seen corresponding path program 1 times [2025-01-09 21:36:27,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:27,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796635138] [2025-01-09 21:36:27,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:27,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:27,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 21:36:27,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 21:36:27,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:27,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:27,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:27,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796635138] [2025-01-09 21:36:27,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796635138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:27,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:27,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:27,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381693371] [2025-01-09 21:36:27,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:28,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:28,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:28,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:28,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:28,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 467 [2025-01-09 21:36:28,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 373 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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-01-09 21:36:28,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:28,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 467 [2025-01-09 21:36:28,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:28,999 INFO L124 PetriNetUnfolderBase]: 1749/8110 cut-off events. [2025-01-09 21:36:28,999 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-01-09 21:36:29,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11188 conditions, 8110 events. 1749/8110 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 71480 event pairs, 642 based on Foata normal form. 0/7057 useless extension candidates. Maximal degree in co-relation 11031. Up to 1448 conditions per place. [2025-01-09 21:36:29,025 INFO L140 encePairwiseOnDemand]: 456/467 looper letters, 44 selfloop transitions, 8 changer transitions 0/397 dead transitions. [2025-01-09 21:36:29,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 397 transitions, 944 flow [2025-01-09 21:36:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1321 transitions. [2025-01-09 21:36:29,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428979300499644 [2025-01-09 21:36:29,028 INFO L175 Difference]: Start difference. First operand has 374 places, 373 transitions, 786 flow. Second operand 3 states and 1321 transitions. [2025-01-09 21:36:29,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 397 transitions, 944 flow [2025-01-09 21:36:29,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 397 transitions, 944 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:29,032 INFO L231 Difference]: Finished difference. Result has 378 places, 381 transitions, 856 flow [2025-01-09 21:36:29,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=378, PETRI_TRANSITIONS=381} [2025-01-09 21:36:29,033 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -13 predicate places. [2025-01-09 21:36:29,033 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 381 transitions, 856 flow [2025-01-09 21:36:29,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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-01-09 21:36:29,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:29,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:29,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:36:29,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting cleanerErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:29,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:29,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1509307135, now seen corresponding path program 1 times [2025-01-09 21:36:29,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:29,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052142151] [2025-01-09 21:36:29,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:29,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:29,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 21:36:29,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 21:36:29,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:29,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:29,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:29,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:29,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052142151] [2025-01-09 21:36:29,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052142151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:29,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:29,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:29,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873106948] [2025-01-09 21:36:29,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:29,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:29,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:29,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:29,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:29,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 467 [2025-01-09 21:36:29,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 381 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 422.6666666666667) internal successors, (1268), 3 states have internal predecessors, (1268), 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-01-09 21:36:29,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:29,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 467 [2025-01-09 21:36:29,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:30,218 INFO L124 PetriNetUnfolderBase]: 2120/10630 cut-off events. [2025-01-09 21:36:30,219 INFO L125 PetriNetUnfolderBase]: For 154/162 co-relation queries the response was YES. [2025-01-09 21:36:30,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14453 conditions, 10630 events. 2120/10630 cut-off events. For 154/162 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 101163 event pairs, 1244 based on Foata normal form. 0/9528 useless extension candidates. Maximal degree in co-relation 14294. Up to 2843 conditions per place. [2025-01-09 21:36:30,251 INFO L140 encePairwiseOnDemand]: 462/467 looper letters, 35 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2025-01-09 21:36:30,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 391 transitions, 953 flow [2025-01-09 21:36:30,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:30,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2025-01-09 21:36:30,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9300499643112062 [2025-01-09 21:36:30,253 INFO L175 Difference]: Start difference. First operand has 378 places, 381 transitions, 856 flow. Second operand 3 states and 1303 transitions. [2025-01-09 21:36:30,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 391 transitions, 953 flow [2025-01-09 21:36:30,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 391 transitions, 937 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:30,258 INFO L231 Difference]: Finished difference. Result has 376 places, 380 transitions, 848 flow [2025-01-09 21:36:30,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=376, PETRI_TRANSITIONS=380} [2025-01-09 21:36:30,259 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -15 predicate places. [2025-01-09 21:36:30,259 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 380 transitions, 848 flow [2025-01-09 21:36:30,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 422.6666666666667) internal successors, (1268), 3 states have internal predecessors, (1268), 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-01-09 21:36:30,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:30,260 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:30,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:36:30,260 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:30,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:30,261 INFO L85 PathProgramCache]: Analyzing trace with hash 244701458, now seen corresponding path program 1 times [2025-01-09 21:36:30,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:30,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801625889] [2025-01-09 21:36:30,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:30,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:30,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 21:36:30,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 21:36:30,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:30,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:30,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:30,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801625889] [2025-01-09 21:36:30,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801625889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:30,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:30,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:30,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732314942] [2025-01-09 21:36:30,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:30,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:30,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:30,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:30,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:30,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 467 [2025-01-09 21:36:30,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 380 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 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-01-09 21:36:30,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:30,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 467 [2025-01-09 21:36:30,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:32,663 INFO L124 PetriNetUnfolderBase]: 4584/20498 cut-off events. [2025-01-09 21:36:32,663 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-01-09 21:36:32,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29224 conditions, 20498 events. 4584/20498 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 220287 event pairs, 2480 based on Foata normal form. 0/18556 useless extension candidates. Maximal degree in co-relation 29064. Up to 5342 conditions per place. [2025-01-09 21:36:32,745 INFO L140 encePairwiseOnDemand]: 457/467 looper letters, 45 selfloop transitions, 9 changer transitions 0/403 dead transitions. [2025-01-09 21:36:32,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 403 transitions, 1008 flow [2025-01-09 21:36:32,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1321 transitions. [2025-01-09 21:36:32,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428979300499644 [2025-01-09 21:36:32,748 INFO L175 Difference]: Start difference. First operand has 376 places, 380 transitions, 848 flow. Second operand 3 states and 1321 transitions. [2025-01-09 21:36:32,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 403 transitions, 1008 flow [2025-01-09 21:36:32,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 403 transitions, 1008 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:32,754 INFO L231 Difference]: Finished difference. Result has 380 places, 388 transitions, 918 flow [2025-01-09 21:36:32,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=918, PETRI_PLACES=380, PETRI_TRANSITIONS=388} [2025-01-09 21:36:32,755 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -11 predicate places. [2025-01-09 21:36:32,755 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 388 transitions, 918 flow [2025-01-09 21:36:32,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 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-01-09 21:36:32,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:32,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:32,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:36:32,756 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:32,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:32,756 INFO L85 PathProgramCache]: Analyzing trace with hash -522211293, now seen corresponding path program 1 times [2025-01-09 21:36:32,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:32,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817026111] [2025-01-09 21:36:32,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:32,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:32,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 21:36:32,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 21:36:32,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:32,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:32,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:32,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817026111] [2025-01-09 21:36:32,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817026111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:32,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:32,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:32,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134900494] [2025-01-09 21:36:32,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:32,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:36:32,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:32,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:36:32,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:36:33,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 467 [2025-01-09 21:36:33,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 388 transitions, 918 flow. Second operand has 5 states, 5 states have (on average 426.8) internal successors, (2134), 5 states have internal predecessors, (2134), 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-01-09 21:36:33,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:33,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 467 [2025-01-09 21:36:33,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:35,260 INFO L124 PetriNetUnfolderBase]: 2608/15740 cut-off events. [2025-01-09 21:36:35,261 INFO L125 PetriNetUnfolderBase]: For 512/576 co-relation queries the response was YES. [2025-01-09 21:36:35,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22205 conditions, 15740 events. 2608/15740 cut-off events. For 512/576 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 171955 event pairs, 1917 based on Foata normal form. 4/14270 useless extension candidates. Maximal degree in co-relation 22041. Up to 3513 conditions per place. [2025-01-09 21:36:35,333 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 36 selfloop transitions, 8 changer transitions 0/402 dead transitions. [2025-01-09 21:36:35,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 402 transitions, 1033 flow [2025-01-09 21:36:35,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2595 transitions. [2025-01-09 21:36:35,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9261241970021413 [2025-01-09 21:36:35,337 INFO L175 Difference]: Start difference. First operand has 380 places, 388 transitions, 918 flow. Second operand 6 states and 2595 transitions. [2025-01-09 21:36:35,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 402 transitions, 1033 flow [2025-01-09 21:36:35,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 402 transitions, 1015 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:35,347 INFO L231 Difference]: Finished difference. Result has 387 places, 392 transitions, 945 flow [2025-01-09 21:36:35,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=945, PETRI_PLACES=387, PETRI_TRANSITIONS=392} [2025-01-09 21:36:35,348 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -4 predicate places. [2025-01-09 21:36:35,348 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 392 transitions, 945 flow [2025-01-09 21:36:35,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 426.8) internal successors, (2134), 5 states have internal predecessors, (2134), 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-01-09 21:36:35,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:35,349 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:35,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:36:35,350 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:35,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:35,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1169954021, now seen corresponding path program 1 times [2025-01-09 21:36:35,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:35,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401118519] [2025-01-09 21:36:35,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:35,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:35,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 21:36:35,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 21:36:35,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:35,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:35,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:35,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401118519] [2025-01-09 21:36:35,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401118519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:35,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:35,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:35,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136282908] [2025-01-09 21:36:35,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:35,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:35,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:35,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:35,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:35,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 433 out of 467 [2025-01-09 21:36:35,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 392 transitions, 945 flow. Second operand has 3 states, 3 states have (on average 434.6666666666667) internal successors, (1304), 3 states have internal predecessors, (1304), 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-01-09 21:36:35,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:35,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 433 of 467 [2025-01-09 21:36:35,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:37,413 INFO L124 PetriNetUnfolderBase]: 3169/16434 cut-off events. [2025-01-09 21:36:37,413 INFO L125 PetriNetUnfolderBase]: For 227/258 co-relation queries the response was YES. [2025-01-09 21:36:37,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23524 conditions, 16434 events. 3169/16434 cut-off events. For 227/258 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 176494 event pairs, 1835 based on Foata normal form. 2/14649 useless extension candidates. Maximal degree in co-relation 23356. Up to 3415 conditions per place. [2025-01-09 21:36:37,505 INFO L140 encePairwiseOnDemand]: 463/467 looper letters, 29 selfloop transitions, 3 changer transitions 0/403 dead transitions. [2025-01-09 21:36:37,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 403 transitions, 1034 flow [2025-01-09 21:36:37,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1332 transitions. [2025-01-09 21:36:37,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9507494646680942 [2025-01-09 21:36:37,512 INFO L175 Difference]: Start difference. First operand has 387 places, 392 transitions, 945 flow. Second operand 3 states and 1332 transitions. [2025-01-09 21:36:37,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 403 transitions, 1034 flow [2025-01-09 21:36:37,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 403 transitions, 1030 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:36:37,518 INFO L231 Difference]: Finished difference. Result has 390 places, 394 transitions, 963 flow [2025-01-09 21:36:37,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=963, PETRI_PLACES=390, PETRI_TRANSITIONS=394} [2025-01-09 21:36:37,520 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -1 predicate places. [2025-01-09 21:36:37,520 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 394 transitions, 963 flow [2025-01-09 21:36:37,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 434.6666666666667) internal successors, (1304), 3 states have internal predecessors, (1304), 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-01-09 21:36:37,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:37,522 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, 1, 1, 1, 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-01-09 21:36:37,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:36:37,522 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:37,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:37,523 INFO L85 PathProgramCache]: Analyzing trace with hash 646924222, now seen corresponding path program 1 times [2025-01-09 21:36:37,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:37,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511985050] [2025-01-09 21:36:37,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:37,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:37,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 21:36:37,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 21:36:37,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:37,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:37,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:37,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511985050] [2025-01-09 21:36:37,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511985050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:37,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:37,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:37,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854562496] [2025-01-09 21:36:37,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:37,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:36:37,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:37,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:36:37,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:36:37,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 467 [2025-01-09 21:36:37,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 394 transitions, 963 flow. Second operand has 5 states, 5 states have (on average 427.0) internal successors, (2135), 5 states have internal predecessors, (2135), 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-01-09 21:36:37,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:37,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 467 [2025-01-09 21:36:37,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:40,636 INFO L124 PetriNetUnfolderBase]: 3868/20104 cut-off events. [2025-01-09 21:36:40,637 INFO L125 PetriNetUnfolderBase]: For 736/768 co-relation queries the response was YES. [2025-01-09 21:36:40,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29513 conditions, 20104 events. 3868/20104 cut-off events. For 736/768 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 223815 event pairs, 2588 based on Foata normal form. 6/18313 useless extension candidates. Maximal degree in co-relation 29342. Up to 5217 conditions per place. [2025-01-09 21:36:40,737 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 27 selfloop transitions, 4 changer transitions 17/406 dead transitions. [2025-01-09 21:36:40,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 406 transitions, 1078 flow [2025-01-09 21:36:40,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2596 transitions. [2025-01-09 21:36:40,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926481084939329 [2025-01-09 21:36:40,740 INFO L175 Difference]: Start difference. First operand has 390 places, 394 transitions, 963 flow. Second operand 6 states and 2596 transitions. [2025-01-09 21:36:40,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 406 transitions, 1078 flow [2025-01-09 21:36:40,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 406 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:40,751 INFO L231 Difference]: Finished difference. Result has 395 places, 389 transitions, 944 flow [2025-01-09 21:36:40,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=944, PETRI_PLACES=395, PETRI_TRANSITIONS=389} [2025-01-09 21:36:40,752 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 4 predicate places. [2025-01-09 21:36:40,752 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 389 transitions, 944 flow [2025-01-09 21:36:40,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 427.0) internal successors, (2135), 5 states have internal predecessors, (2135), 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-01-09 21:36:40,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:40,753 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 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-01-09 21:36:40,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:36:40,753 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:40,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:40,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1744580107, now seen corresponding path program 1 times [2025-01-09 21:36:40,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:40,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778568302] [2025-01-09 21:36:40,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:40,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:40,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 21:36:40,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 21:36:40,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:40,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:36:41,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:41,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778568302] [2025-01-09 21:36:41,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778568302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:41,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:41,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:41,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053475470] [2025-01-09 21:36:41,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:41,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:36:41,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:41,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:36:41,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:36:41,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 467 [2025-01-09 21:36:41,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 389 transitions, 944 flow. Second operand has 6 states, 6 states have (on average 410.8333333333333) internal successors, (2465), 6 states have internal predecessors, (2465), 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-01-09 21:36:41,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:41,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 467 [2025-01-09 21:36:41,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:45,799 INFO L124 PetriNetUnfolderBase]: 9025/32026 cut-off events. [2025-01-09 21:36:45,800 INFO L125 PetriNetUnfolderBase]: For 2456/2579 co-relation queries the response was YES. [2025-01-09 21:36:45,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53460 conditions, 32026 events. 9025/32026 cut-off events. For 2456/2579 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 361459 event pairs, 4745 based on Foata normal form. 4/29082 useless extension candidates. Maximal degree in co-relation 53285. Up to 11087 conditions per place. [2025-01-09 21:36:45,987 INFO L140 encePairwiseOnDemand]: 453/467 looper letters, 95 selfloop transitions, 46 changer transitions 0/485 dead transitions. [2025-01-09 21:36:45,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 485 transitions, 1500 flow [2025-01-09 21:36:45,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2579 transitions. [2025-01-09 21:36:45,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9204139900071378 [2025-01-09 21:36:45,992 INFO L175 Difference]: Start difference. First operand has 395 places, 389 transitions, 944 flow. Second operand 6 states and 2579 transitions. [2025-01-09 21:36:45,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 485 transitions, 1500 flow [2025-01-09 21:36:46,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 485 transitions, 1472 flow, removed 7 selfloop flow, removed 9 redundant places. [2025-01-09 21:36:46,019 INFO L231 Difference]: Finished difference. Result has 391 places, 434 transitions, 1251 flow [2025-01-09 21:36:46,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1251, PETRI_PLACES=391, PETRI_TRANSITIONS=434} [2025-01-09 21:36:46,024 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 0 predicate places. [2025-01-09 21:36:46,024 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 434 transitions, 1251 flow [2025-01-09 21:36:46,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 410.8333333333333) internal successors, (2465), 6 states have internal predecessors, (2465), 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-01-09 21:36:46,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:46,025 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:36:46,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:36:46,025 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:46,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:46,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1091775274, now seen corresponding path program 1 times [2025-01-09 21:36:46,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:46,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577094136] [2025-01-09 21:36:46,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:46,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:46,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-09 21:36:46,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-09 21:36:46,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:46,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:36:46,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:46,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577094136] [2025-01-09 21:36:46,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577094136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:46,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:46,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:36:46,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195157136] [2025-01-09 21:36:46,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:46,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:36:46,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:46,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:36:46,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:36:46,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 467 [2025-01-09 21:36:46,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 434 transitions, 1251 flow. Second operand has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 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-01-09 21:36:46,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:46,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 467 [2025-01-09 21:36:46,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:51,706 INFO L124 PetriNetUnfolderBase]: 9764/40840 cut-off events. [2025-01-09 21:36:51,706 INFO L125 PetriNetUnfolderBase]: For 3923/6024 co-relation queries the response was YES. [2025-01-09 21:36:51,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67860 conditions, 40840 events. 9764/40840 cut-off events. For 3923/6024 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 502165 event pairs, 4575 based on Foata normal form. 257/36947 useless extension candidates. Maximal degree in co-relation 67691. Up to 10939 conditions per place. [2025-01-09 21:36:51,956 INFO L140 encePairwiseOnDemand]: 455/467 looper letters, 64 selfloop transitions, 14 changer transitions 10/483 dead transitions. [2025-01-09 21:36:51,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 483 transitions, 1530 flow [2025-01-09 21:36:51,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:36:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:36:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4268 transitions. [2025-01-09 21:36:51,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9139186295503212 [2025-01-09 21:36:51,962 INFO L175 Difference]: Start difference. First operand has 391 places, 434 transitions, 1251 flow. Second operand 10 states and 4268 transitions. [2025-01-09 21:36:51,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 483 transitions, 1530 flow [2025-01-09 21:36:51,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 483 transitions, 1530 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:51,976 INFO L231 Difference]: Finished difference. Result has 404 places, 441 transitions, 1318 flow [2025-01-09 21:36:51,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1318, PETRI_PLACES=404, PETRI_TRANSITIONS=441} [2025-01-09 21:36:51,976 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 13 predicate places. [2025-01-09 21:36:51,977 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 441 transitions, 1318 flow [2025-01-09 21:36:51,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 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-01-09 21:36:51,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:51,978 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:36:51,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:36:51,978 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:51,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:51,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1427498557, now seen corresponding path program 1 times [2025-01-09 21:36:51,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:51,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567660471] [2025-01-09 21:36:51,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:51,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:51,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 21:36:52,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 21:36:52,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:52,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:36:52,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:52,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567660471] [2025-01-09 21:36:52,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567660471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:52,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:52,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:36:52,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016401075] [2025-01-09 21:36:52,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:52,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:36:52,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:52,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:36:52,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:36:52,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 467 [2025-01-09 21:36:52,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 441 transitions, 1318 flow. Second operand has 8 states, 8 states have (on average 414.875) internal successors, (3319), 8 states have internal predecessors, (3319), 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-01-09 21:36:52,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:52,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 467 [2025-01-09 21:36:52,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:58,934 INFO L124 PetriNetUnfolderBase]: 11533/46369 cut-off events. [2025-01-09 21:36:58,935 INFO L125 PetriNetUnfolderBase]: For 16064/17713 co-relation queries the response was YES. [2025-01-09 21:36:59,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86597 conditions, 46369 events. 11533/46369 cut-off events. For 16064/17713 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 569983 event pairs, 4007 based on Foata normal form. 118/42673 useless extension candidates. Maximal degree in co-relation 86422. Up to 8375 conditions per place. [2025-01-09 21:36:59,234 INFO L140 encePairwiseOnDemand]: 454/467 looper letters, 101 selfloop transitions, 44 changer transitions 0/511 dead transitions. [2025-01-09 21:36:59,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 511 transitions, 1900 flow [2025-01-09 21:36:59,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:36:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:36:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4639 transitions. [2025-01-09 21:36:59,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.903056258516644 [2025-01-09 21:36:59,241 INFO L175 Difference]: Start difference. First operand has 404 places, 441 transitions, 1318 flow. Second operand 11 states and 4639 transitions. [2025-01-09 21:36:59,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 511 transitions, 1900 flow [2025-01-09 21:36:59,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 511 transitions, 1892 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:36:59,268 INFO L231 Difference]: Finished difference. Result has 414 places, 462 transitions, 1635 flow [2025-01-09 21:36:59,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1635, PETRI_PLACES=414, PETRI_TRANSITIONS=462} [2025-01-09 21:36:59,268 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 23 predicate places. [2025-01-09 21:36:59,269 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 462 transitions, 1635 flow [2025-01-09 21:36:59,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 414.875) internal successors, (3319), 8 states have internal predecessors, (3319), 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-01-09 21:36:59,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:59,270 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:36:59,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:36:59,270 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:36:59,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:59,271 INFO L85 PathProgramCache]: Analyzing trace with hash -208325691, now seen corresponding path program 1 times [2025-01-09 21:36:59,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:59,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543372267] [2025-01-09 21:36:59,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:59,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:59,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-09 21:36:59,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-09 21:36:59,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:59,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:36:59,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:59,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543372267] [2025-01-09 21:36:59,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543372267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:59,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:59,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:59,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045865182] [2025-01-09 21:36:59,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:59,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:59,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:59,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:59,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:59,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 467 [2025-01-09 21:36:59,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 462 transitions, 1635 flow. Second operand has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 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-01-09 21:36:59,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:59,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 467 [2025-01-09 21:36:59,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:00,908 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][360], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 459#true, Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 525#true, 574#true, Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 236#L1040-7true, Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 535#true, 70#L1034-5true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 217#L1066-10true, Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-01-09 21:37:00,909 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is not cut-off event [2025-01-09 21:37:00,909 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is not cut-off event [2025-01-09 21:37:00,909 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is not cut-off event [2025-01-09 21:37:00,909 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is not cut-off event [2025-01-09 21:37:01,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 304#L1066-7true, 459#true, Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 525#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 574#true, Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 535#true, 70#L1034-5true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 390#L1043-4true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-01-09 21:37:01,229 INFO L294 olderBase$Statistics]: this new event has 319 ancestors and is cut-off event [2025-01-09 21:37:01,230 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-01-09 21:37:01,230 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-01-09 21:37:01,230 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-01-09 21:37:01,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 459#true, Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 525#true, 574#true, Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 287#L1066-8true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 535#true, 70#L1034-5true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 390#L1043-4true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-01-09 21:37:01,240 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-01-09 21:37:01,240 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-01-09 21:37:01,240 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-01-09 21:37:01,240 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-01-09 21:37:01,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 304#L1066-7true, 459#true, Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 574#true, 525#true, Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 535#true, 70#L1034-5true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 324#L1043-5true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-01-09 21:37:01,240 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-01-09 21:37:01,240 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-01-09 21:37:01,240 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-01-09 21:37:01,240 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-01-09 21:37:01,252 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 304#L1066-7true, 459#true, Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 574#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 525#true, Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 70#L1034-5true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 390#L1043-4true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-01-09 21:37:01,253 INFO L294 olderBase$Statistics]: this new event has 319 ancestors and is cut-off event [2025-01-09 21:37:01,253 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-01-09 21:37:01,253 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-01-09 21:37:01,253 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2025-01-09 21:37:01,253 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-01-09 21:37:01,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 20#L1066-9true, 459#true, Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 574#true, 525#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 70#L1034-5true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 390#L1043-4true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-01-09 21:37:01,254 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-01-09 21:37:01,254 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-01-09 21:37:01,254 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-01-09 21:37:01,254 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-01-09 21:37:01,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 459#true, Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 574#true, 525#true, Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 287#L1066-8true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 535#true, 70#L1034-5true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 324#L1043-5true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-01-09 21:37:01,254 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-01-09 21:37:01,254 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-01-09 21:37:01,254 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-01-09 21:37:01,254 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-01-09 21:37:01,267 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 459#true, Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 525#true, 574#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 287#L1066-8true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 70#L1034-5true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 390#L1043-4true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-01-09 21:37:01,268 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-01-09 21:37:01,268 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-01-09 21:37:01,268 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-01-09 21:37:01,268 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-01-09 21:37:01,268 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-01-09 21:37:01,268 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 304#L1066-7true, 459#true, Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 525#true, 574#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 70#L1034-5true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 324#L1043-5true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-01-09 21:37:01,268 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-01-09 21:37:01,268 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-01-09 21:37:01,268 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-01-09 21:37:01,268 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-01-09 21:37:01,268 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-01-09 21:37:01,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 20#L1066-9true, 459#true, Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 574#true, 525#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 70#L1034-5true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 324#L1043-5true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-01-09 21:37:01,269 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2025-01-09 21:37:01,269 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-01-09 21:37:01,269 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-01-09 21:37:01,270 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-01-09 21:37:01,284 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 20#L1066-9true, 459#true, Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 525#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 574#true, Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 70#L1034-5true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 390#L1043-4true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-01-09 21:37:01,284 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-01-09 21:37:01,284 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-01-09 21:37:01,284 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-01-09 21:37:01,284 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-01-09 21:37:01,284 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-01-09 21:37:01,285 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 459#true, Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 525#true, 574#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 287#L1066-8true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 70#L1034-5true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 324#L1043-5true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-01-09 21:37:01,285 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-01-09 21:37:01,285 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-01-09 21:37:01,285 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-01-09 21:37:01,285 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-01-09 21:37:01,285 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-01-09 21:37:01,301 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 20#L1066-9true, 459#true, Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 574#true, 525#true, Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 70#L1034-5true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 324#L1043-5true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-01-09 21:37:01,301 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2025-01-09 21:37:01,301 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2025-01-09 21:37:01,301 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-01-09 21:37:01,301 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-01-09 21:37:01,301 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event