./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.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-ext/48_ticket_lock_low_contention_vs-pthread.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 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:07:43,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:07:43,117 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:07:43,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:07:43,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:07:43,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:07:43,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:07:43,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:07:43,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:07:43,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:07:43,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:07:43,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:07:43,150 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:07:43,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:07:43,151 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:07:43,151 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:07:43,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:07:43,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:07:43,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:07:43,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:07:43,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:07:43,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:07:43,151 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:07:43,151 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:07:43,151 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:07:43,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:07:43,152 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:07:43,152 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:07:43,152 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:07:43,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:07:43,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:07:43,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:07:43,152 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:07:43,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:07:43,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:07:43,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:07:43,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:07:43,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:07:43,153 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:07:43,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:07:43,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:07:43,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:07:43,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:07:43,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:07:43,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:07:43,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:07:43,154 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 -> 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 [2025-01-09 21:07:43,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:07:43,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:07:43,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:07:43,414 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:07:43,415 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:07:43,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2025-01-09 21:07:44,507 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76232d0f3/5d71cb29ce3c48feb2c0fd6d5e22b6d5/FLAG13992fa0d [2025-01-09 21:07:44,788 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:07:44,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2025-01-09 21:07:44,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76232d0f3/5d71cb29ce3c48feb2c0fd6d5e22b6d5/FLAG13992fa0d [2025-01-09 21:07:44,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76232d0f3/5d71cb29ce3c48feb2c0fd6d5e22b6d5 [2025-01-09 21:07:44,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:07:44,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:07:44,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:07:44,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:07:44,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:07:44,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:07:44" (1/1) ... [2025-01-09 21:07:44,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@434c1a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:44, skipping insertion in model container [2025-01-09 21:07:44,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:07:44" (1/1) ... [2025-01-09 21:07:44,858 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:07:45,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:07:45,092 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:07:45,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:07:45,145 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:07:45,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:45 WrapperNode [2025-01-09 21:07:45,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:07:45,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:07:45,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:07:45,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:07:45,155 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:07:45" (1/1) ... [2025-01-09 21:07:45,164 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:07:45" (1/1) ... [2025-01-09 21:07:45,175 INFO L138 Inliner]: procedures = 164, calls = 17, calls flagged for inlining = 4, calls inlined = 5, statements flattened = 86 [2025-01-09 21:07:45,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:07:45,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:07:45,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:07:45,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:07:45,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:45" (1/1) ... [2025-01-09 21:07:45,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:45" (1/1) ... [2025-01-09 21:07:45,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:45" (1/1) ... [2025-01-09 21:07:45,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:45" (1/1) ... [2025-01-09 21:07:45,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:45" (1/1) ... [2025-01-09 21:07:45,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:45" (1/1) ... [2025-01-09 21:07:45,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:45" (1/1) ... [2025-01-09 21:07:45,188 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:45" (1/1) ... [2025-01-09 21:07:45,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:45" (1/1) ... [2025-01-09 21:07:45,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:07:45,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:07:45,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:07:45,190 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:07:45,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:45" (1/1) ... [2025-01-09 21:07:45,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:07:45,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:07:45,223 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:07:45,229 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:07:45,245 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 21:07:45,247 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 21:07:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:07:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:07:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:07:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:07:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:07:45,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:07:45,248 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:07:45,348 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:07:45,350 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:07:45,487 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:07:45,487 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:07:45,511 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:07:45,511 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:07:45,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:07:45 BoogieIcfgContainer [2025-01-09 21:07:45,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:07:45,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:07:45,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:07:45,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:07:45,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:07:44" (1/3) ... [2025-01-09 21:07:45,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a99d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:07:45, skipping insertion in model container [2025-01-09 21:07:45,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:45" (2/3) ... [2025-01-09 21:07:45,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a99d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:07:45, skipping insertion in model container [2025-01-09 21:07:45,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:07:45" (3/3) ... [2025-01-09 21:07:45,525 INFO L128 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2025-01-09 21:07:45,541 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:07:45,542 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 48_ticket_lock_low_contention_vs-pthread.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-01-09 21:07:45,543 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:07:45,596 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:07:45,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 99 transitions, 202 flow [2025-01-09 21:07:45,686 INFO L124 PetriNetUnfolderBase]: 8/149 cut-off events. [2025-01-09 21:07:45,688 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:07:45,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 149 events. 8/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 355 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2025-01-09 21:07:45,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 99 transitions, 202 flow [2025-01-09 21:07:45,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 99 transitions, 202 flow [2025-01-09 21:07:45,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:07:45,708 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;@33b5570f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:07:45,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-09 21:07:45,716 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:07:45,717 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2025-01-09 21:07:45,717 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:07:45,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:45,717 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] [2025-01-09 21:07:45,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:07:45,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1383098230, now seen corresponding path program 1 times [2025-01-09 21:07:45,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:45,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873295774] [2025-01-09 21:07:45,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:45,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:45,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:07:45,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:07:45,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:45,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:45,841 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:07:45,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:45,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873295774] [2025-01-09 21:07:45,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873295774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:45,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:45,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:45,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202990592] [2025-01-09 21:07:45,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:45,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:07:45,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:45,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:07:45,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:07:45,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 99 [2025-01-09 21:07:45,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 202 flow. Second operand has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 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:07:45,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:45,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 99 [2025-01-09 21:07:45,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:45,936 INFO L124 PetriNetUnfolderBase]: 4/189 cut-off events. [2025-01-09 21:07:45,936 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:07:45,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 189 events. 4/189 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 552 event pairs, 4 based on Foata normal form. 16/181 useless extension candidates. Maximal degree in co-relation 137. Up to 16 conditions per place. [2025-01-09 21:07:45,938 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 5 selfloop transitions, 0 changer transitions 0/90 dead transitions. [2025-01-09 21:07:45,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 194 flow [2025-01-09 21:07:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:07:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:07:45,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2025-01-09 21:07:45,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2025-01-09 21:07:45,948 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 202 flow. Second operand 2 states and 184 transitions. [2025-01-09 21:07:45,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 194 flow [2025-01-09 21:07:45,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:45,953 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 184 flow [2025-01-09 21:07:45,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=184, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2025-01-09 21:07:45,958 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, -3 predicate places. [2025-01-09 21:07:45,958 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 184 flow [2025-01-09 21:07:45,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 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:07:45,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:45,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:07:45,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:07:45,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:07:45,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:45,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1979788872, now seen corresponding path program 1 times [2025-01-09 21:07:45,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:45,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040537556] [2025-01-09 21:07:45,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:45,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:45,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:07:45,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:07:45,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:45,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:46,058 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:07:46,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:46,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040537556] [2025-01-09 21:07:46,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040537556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:46,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:46,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:46,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686271455] [2025-01-09 21:07:46,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:46,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:46,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:46,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:46,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:46,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 99 [2025-01-09 21:07:46,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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:07:46,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:46,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 99 [2025-01-09 21:07:46,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:46,185 INFO L124 PetriNetUnfolderBase]: 59/448 cut-off events. [2025-01-09 21:07:46,185 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:07:46,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 448 events. 59/448 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2372 event pairs, 41 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 597. Up to 126 conditions per place. [2025-01-09 21:07:46,189 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 18 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2025-01-09 21:07:46,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 246 flow [2025-01-09 21:07:46,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2025-01-09 21:07:46,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8417508417508418 [2025-01-09 21:07:46,191 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 184 flow. Second operand 3 states and 250 transitions. [2025-01-09 21:07:46,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 246 flow [2025-01-09 21:07:46,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:46,195 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 230 flow [2025-01-09 21:07:46,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2025-01-09 21:07:46,196 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places. [2025-01-09 21:07:46,196 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 230 flow [2025-01-09 21:07:46,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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:07:46,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:46,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:07:46,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:07:46,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:07:46,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1835186691, now seen corresponding path program 1 times [2025-01-09 21:07:46,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:46,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606227592] [2025-01-09 21:07:46,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:46,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:46,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:07:46,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:07:46,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:46,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:46,232 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:07:46,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:46,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606227592] [2025-01-09 21:07:46,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606227592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:46,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:46,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:46,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395581036] [2025-01-09 21:07:46,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:46,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:46,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:46,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:46,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:46,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 99 [2025-01-09 21:07:46,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:07:46,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:46,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 99 [2025-01-09 21:07:46,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:46,315 INFO L124 PetriNetUnfolderBase]: 64/427 cut-off events. [2025-01-09 21:07:46,315 INFO L125 PetriNetUnfolderBase]: For 46/48 co-relation queries the response was YES. [2025-01-09 21:07:46,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 427 events. 64/427 cut-off events. For 46/48 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2342 event pairs, 32 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 667. Up to 119 conditions per place. [2025-01-09 21:07:46,318 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 18 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2025-01-09 21:07:46,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 102 transitions, 298 flow [2025-01-09 21:07:46,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:46,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-01-09 21:07:46,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8552188552188552 [2025-01-09 21:07:46,319 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 230 flow. Second operand 3 states and 254 transitions. [2025-01-09 21:07:46,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 102 transitions, 298 flow [2025-01-09 21:07:46,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 102 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:07:46,322 INFO L231 Difference]: Finished difference. Result has 100 places, 100 transitions, 270 flow [2025-01-09 21:07:46,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=100, PETRI_TRANSITIONS=100} [2025-01-09 21:07:46,323 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 3 predicate places. [2025-01-09 21:07:46,323 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 100 transitions, 270 flow [2025-01-09 21:07:46,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:07:46,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:46,323 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:07:46,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:07:46,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:07:46,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:46,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2036636934, now seen corresponding path program 1 times [2025-01-09 21:07:46,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:46,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745385124] [2025-01-09 21:07:46,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:46,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:46,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:07:46,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:07:46,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:46,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:07:46,336 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:07:46,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:07:46,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:07:46,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:46,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:07:46,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:07:46,353 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:07:46,354 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-09 21:07:46,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-01-09 21:07:46,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-01-09 21:07:46,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-01-09 21:07:46,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-01-09 21:07:46,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-01-09 21:07:46,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-01-09 21:07:46,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-01-09 21:07:46,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-01-09 21:07:46,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-01-09 21:07:46,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:07:46,356 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:07:46,358 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:07:46,358 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:07:46,381 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:07:46,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 130 transitions, 270 flow [2025-01-09 21:07:46,415 INFO L124 PetriNetUnfolderBase]: 13/230 cut-off events. [2025-01-09 21:07:46,415 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:07:46,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 230 events. 13/230 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 771 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 150. Up to 6 conditions per place. [2025-01-09 21:07:46,417 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 130 transitions, 270 flow [2025-01-09 21:07:46,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 130 transitions, 270 flow [2025-01-09 21:07:46,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:07:46,428 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;@33b5570f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:07:46,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-09 21:07:46,435 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:07:46,435 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2025-01-09 21:07:46,435 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:07:46,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:46,435 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] [2025-01-09 21:07:46,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:07:46,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:46,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1523227382, now seen corresponding path program 1 times [2025-01-09 21:07:46,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:46,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94384648] [2025-01-09 21:07:46,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:46,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:46,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:07:46,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:07:46,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:46,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:46,456 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:07:46,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:46,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94384648] [2025-01-09 21:07:46,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94384648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:46,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:46,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8268866] [2025-01-09 21:07:46,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:46,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:07:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:46,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:07:46,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:07:46,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 130 [2025-01-09 21:07:46,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 130 transitions, 270 flow. Second operand has 2 states, 2 states have (on average 113.0) internal successors, (226), 2 states have internal predecessors, (226), 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:07:46,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:46,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 130 [2025-01-09 21:07:46,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:46,513 INFO L124 PetriNetUnfolderBase]: 34/566 cut-off events. [2025-01-09 21:07:46,513 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:07:46,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 566 events. 34/566 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3257 event pairs, 34 based on Foata normal form. 67/546 useless extension candidates. Maximal degree in co-relation 429. Up to 73 conditions per place. [2025-01-09 21:07:46,517 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 8 selfloop transitions, 0 changer transitions 0/117 dead transitions. [2025-01-09 21:07:46,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 260 flow [2025-01-09 21:07:46,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:07:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:07:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions. [2025-01-09 21:07:46,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9192307692307692 [2025-01-09 21:07:46,519 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 270 flow. Second operand 2 states and 239 transitions. [2025-01-09 21:07:46,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 117 transitions, 260 flow [2025-01-09 21:07:46,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 117 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:46,521 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 244 flow [2025-01-09 21:07:46,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=244, PETRI_PLACES=123, PETRI_TRANSITIONS=117} [2025-01-09 21:07:46,521 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, -5 predicate places. [2025-01-09 21:07:46,521 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 244 flow [2025-01-09 21:07:46,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.0) internal successors, (226), 2 states have internal predecessors, (226), 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:07:46,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:46,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] [2025-01-09 21:07:46,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:07:46,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:07:46,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:46,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1859273482, now seen corresponding path program 1 times [2025-01-09 21:07:46,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:46,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71990839] [2025-01-09 21:07:46,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:46,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:46,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:07:46,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:07:46,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:46,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:46,558 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:07:46,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:46,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71990839] [2025-01-09 21:07:46,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71990839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:46,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:46,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:46,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888722921] [2025-01-09 21:07:46,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:46,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:46,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:46,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:46,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:46,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2025-01-09 21:07:46,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 117 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:07:46,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:46,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2025-01-09 21:07:46,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:46,906 INFO L124 PetriNetUnfolderBase]: 845/3283 cut-off events. [2025-01-09 21:07:46,907 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-09 21:07:46,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4733 conditions, 3283 events. 845/3283 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 29790 event pairs, 632 based on Foata normal form. 0/2783 useless extension candidates. Maximal degree in co-relation 4728. Up to 1252 conditions per place. [2025-01-09 21:07:46,919 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 26 selfloop transitions, 9 changer transitions 0/129 dead transitions. [2025-01-09 21:07:46,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 129 transitions, 338 flow [2025-01-09 21:07:46,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2025-01-09 21:07:46,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2025-01-09 21:07:46,921 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 244 flow. Second operand 3 states and 327 transitions. [2025-01-09 21:07:46,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 129 transitions, 338 flow [2025-01-09 21:07:46,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 129 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:46,923 INFO L231 Difference]: Finished difference. Result has 127 places, 125 transitions, 314 flow [2025-01-09 21:07:46,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=127, PETRI_TRANSITIONS=125} [2025-01-09 21:07:46,923 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, -1 predicate places. [2025-01-09 21:07:46,923 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 314 flow [2025-01-09 21:07:46,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:07:46,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:46,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:07:46,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:07:46,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:07:46,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:46,925 INFO L85 PathProgramCache]: Analyzing trace with hash 586722563, now seen corresponding path program 1 times [2025-01-09 21:07:46,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:46,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885387647] [2025-01-09 21:07:46,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:46,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:46,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:07:46,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:07:46,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:46,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:46,948 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:07:46,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:46,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885387647] [2025-01-09 21:07:46,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885387647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:46,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:46,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:46,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968035171] [2025-01-09 21:07:46,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:46,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:46,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:46,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:46,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:46,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2025-01-09 21:07:46,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 125 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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:07:46,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:46,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2025-01-09 21:07:46,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:47,294 INFO L124 PetriNetUnfolderBase]: 1088/3830 cut-off events. [2025-01-09 21:07:47,294 INFO L125 PetriNetUnfolderBase]: For 861/1014 co-relation queries the response was YES. [2025-01-09 21:07:47,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6732 conditions, 3830 events. 1088/3830 cut-off events. For 861/1014 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 36105 event pairs, 560 based on Foata normal form. 3/3223 useless extension candidates. Maximal degree in co-relation 6725. Up to 1421 conditions per place. [2025-01-09 21:07:47,317 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 30 selfloop transitions, 13 changer transitions 0/141 dead transitions. [2025-01-09 21:07:47,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 141 transitions, 459 flow [2025-01-09 21:07:47,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:47,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2025-01-09 21:07:47,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2025-01-09 21:07:47,319 INFO L175 Difference]: Start difference. First operand has 127 places, 125 transitions, 314 flow. Second operand 3 states and 332 transitions. [2025-01-09 21:07:47,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 141 transitions, 459 flow [2025-01-09 21:07:47,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 141 transitions, 433 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:07:47,329 INFO L231 Difference]: Finished difference. Result has 129 places, 136 transitions, 408 flow [2025-01-09 21:07:47,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=129, PETRI_TRANSITIONS=136} [2025-01-09 21:07:47,330 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places. [2025-01-09 21:07:47,330 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 136 transitions, 408 flow [2025-01-09 21:07:47,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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:07:47,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:47,331 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] [2025-01-09 21:07:47,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:07:47,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:07:47,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:47,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1718394208, now seen corresponding path program 1 times [2025-01-09 21:07:47,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:47,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846957664] [2025-01-09 21:07:47,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:47,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:47,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:07:47,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:07:47,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:47,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:47,365 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:07:47,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:47,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846957664] [2025-01-09 21:07:47,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846957664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:47,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:47,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:47,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027785616] [2025-01-09 21:07:47,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:47,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:47,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:47,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:47,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:47,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2025-01-09 21:07:47,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 136 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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:07:47,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:47,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2025-01-09 21:07:47,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:47,930 INFO L124 PetriNetUnfolderBase]: 2061/6890 cut-off events. [2025-01-09 21:07:47,931 INFO L125 PetriNetUnfolderBase]: For 3809/3989 co-relation queries the response was YES. [2025-01-09 21:07:47,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13659 conditions, 6890 events. 2061/6890 cut-off events. For 3809/3989 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 72076 event pairs, 630 based on Foata normal form. 7/5762 useless extension candidates. Maximal degree in co-relation 13651. Up to 1788 conditions per place. [2025-01-09 21:07:47,973 INFO L140 encePairwiseOnDemand]: 115/130 looper letters, 44 selfloop transitions, 26 changer transitions 0/168 dead transitions. [2025-01-09 21:07:47,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 168 transitions, 707 flow [2025-01-09 21:07:47,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:47,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2025-01-09 21:07:47,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615384615384616 [2025-01-09 21:07:47,978 INFO L175 Difference]: Start difference. First operand has 129 places, 136 transitions, 408 flow. Second operand 3 states and 336 transitions. [2025-01-09 21:07:47,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 168 transitions, 707 flow [2025-01-09 21:07:47,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 168 transitions, 663 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:07:47,988 INFO L231 Difference]: Finished difference. Result has 131 places, 161 transitions, 664 flow [2025-01-09 21:07:47,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=131, PETRI_TRANSITIONS=161} [2025-01-09 21:07:47,990 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 3 predicate places. [2025-01-09 21:07:47,990 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 161 transitions, 664 flow [2025-01-09 21:07:47,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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:07:47,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:47,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] [2025-01-09 21:07:47,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:07:47,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:07:47,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:47,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1577313666, now seen corresponding path program 1 times [2025-01-09 21:07:47,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:47,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155080221] [2025-01-09 21:07:47,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:47,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:47,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:07:48,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:07:48,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:48,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:48,015 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:07:48,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:48,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155080221] [2025-01-09 21:07:48,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155080221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:48,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:48,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:48,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613873846] [2025-01-09 21:07:48,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:48,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:48,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:48,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:48,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:48,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2025-01-09 21:07:48,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 161 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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:07:48,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:48,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2025-01-09 21:07:48,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:48,756 INFO L124 PetriNetUnfolderBase]: 2966/9755 cut-off events. [2025-01-09 21:07:48,756 INFO L125 PetriNetUnfolderBase]: For 15047/15536 co-relation queries the response was YES. [2025-01-09 21:07:48,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23389 conditions, 9755 events. 2966/9755 cut-off events. For 15047/15536 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 106154 event pairs, 1072 based on Foata normal form. 41/8329 useless extension candidates. Maximal degree in co-relation 23380. Up to 3627 conditions per place. [2025-01-09 21:07:48,813 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 60 selfloop transitions, 22 changer transitions 0/183 dead transitions. [2025-01-09 21:07:48,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 183 transitions, 976 flow [2025-01-09 21:07:48,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2025-01-09 21:07:48,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2025-01-09 21:07:48,815 INFO L175 Difference]: Start difference. First operand has 131 places, 161 transitions, 664 flow. Second operand 3 states and 327 transitions. [2025-01-09 21:07:48,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 183 transitions, 976 flow [2025-01-09 21:07:48,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 183 transitions, 908 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:07:48,825 INFO L231 Difference]: Finished difference. Result has 133 places, 179 transitions, 862 flow [2025-01-09 21:07:48,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=133, PETRI_TRANSITIONS=179} [2025-01-09 21:07:48,826 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places. [2025-01-09 21:07:48,826 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 179 transitions, 862 flow [2025-01-09 21:07:48,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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:07:48,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:48,827 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:07:48,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:07:48,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:07:48,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:48,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1349495971, now seen corresponding path program 1 times [2025-01-09 21:07:48,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:48,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343615369] [2025-01-09 21:07:48,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:48,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:07:48,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:07:48,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:48,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:48,855 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:07:48,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:48,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343615369] [2025-01-09 21:07:48,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343615369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:48,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:48,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:48,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423823549] [2025-01-09 21:07:48,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:48,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:48,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:48,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:48,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:48,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2025-01-09 21:07:48,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 179 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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:07:48,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:48,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2025-01-09 21:07:48,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:49,598 INFO L124 PetriNetUnfolderBase]: 3528/10620 cut-off events. [2025-01-09 21:07:49,599 INFO L125 PetriNetUnfolderBase]: For 19378/19830 co-relation queries the response was YES. [2025-01-09 21:07:49,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27729 conditions, 10620 events. 3528/10620 cut-off events. For 19378/19830 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 115217 event pairs, 992 based on Foata normal form. 26/8854 useless extension candidates. Maximal degree in co-relation 27719. Up to 3989 conditions per place. [2025-01-09 21:07:49,653 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 68 selfloop transitions, 36 changer transitions 0/209 dead transitions. [2025-01-09 21:07:49,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 209 transitions, 1284 flow [2025-01-09 21:07:49,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2025-01-09 21:07:49,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487179487179487 [2025-01-09 21:07:49,656 INFO L175 Difference]: Start difference. First operand has 133 places, 179 transitions, 862 flow. Second operand 3 states and 331 transitions. [2025-01-09 21:07:49,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 209 transitions, 1284 flow [2025-01-09 21:07:49,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 209 transitions, 1184 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-01-09 21:07:49,683 INFO L231 Difference]: Finished difference. Result has 135 places, 205 transitions, 1166 flow [2025-01-09 21:07:49,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1166, PETRI_PLACES=135, PETRI_TRANSITIONS=205} [2025-01-09 21:07:49,685 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 7 predicate places. [2025-01-09 21:07:49,685 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 205 transitions, 1166 flow [2025-01-09 21:07:49,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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:07:49,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:49,685 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] [2025-01-09 21:07:49,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:07:49,685 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:07:49,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:49,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1605232236, now seen corresponding path program 1 times [2025-01-09 21:07:49,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:49,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155541172] [2025-01-09 21:07:49,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:49,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:49,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:07:49,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:07:49,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:49,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:49,717 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:07:49,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155541172] [2025-01-09 21:07:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155541172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:49,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:49,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:49,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766729681] [2025-01-09 21:07:49,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:49,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:49,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:49,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:49,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:49,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2025-01-09 21:07:49,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 205 transitions, 1166 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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:07:49,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:49,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2025-01-09 21:07:49,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:50,544 INFO L124 PetriNetUnfolderBase]: 4489/13143 cut-off events. [2025-01-09 21:07:50,544 INFO L125 PetriNetUnfolderBase]: For 33482/34081 co-relation queries the response was YES. [2025-01-09 21:07:50,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37383 conditions, 13143 events. 4489/13143 cut-off events. For 33482/34081 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 145132 event pairs, 1134 based on Foata normal form. 23/11018 useless extension candidates. Maximal degree in co-relation 37372. Up to 4859 conditions per place. [2025-01-09 21:07:50,610 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 91 selfloop transitions, 38 changer transitions 0/236 dead transitions. [2025-01-09 21:07:50,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 236 transitions, 1685 flow [2025-01-09 21:07:50,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2025-01-09 21:07:50,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2025-01-09 21:07:50,612 INFO L175 Difference]: Start difference. First operand has 135 places, 205 transitions, 1166 flow. Second operand 3 states and 332 transitions. [2025-01-09 21:07:50,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 236 transitions, 1685 flow [2025-01-09 21:07:50,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 236 transitions, 1597 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:07:50,630 INFO L231 Difference]: Finished difference. Result has 137 places, 231 transitions, 1530 flow [2025-01-09 21:07:50,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1530, PETRI_PLACES=137, PETRI_TRANSITIONS=231} [2025-01-09 21:07:50,630 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 9 predicate places. [2025-01-09 21:07:50,630 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 231 transitions, 1530 flow [2025-01-09 21:07:50,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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:07:50,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:50,631 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:07:50,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:07:50,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:07:50,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:50,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1977551488, now seen corresponding path program 1 times [2025-01-09 21:07:50,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:50,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056064087] [2025-01-09 21:07:50,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:50,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:50,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:07:50,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:07:50,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:50,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:07:50,642 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:07:50,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:07:50,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:07:50,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:50,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:07:50,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:07:50,658 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:07:50,658 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-09 21:07:50,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-01-09 21:07:50,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-01-09 21:07:50,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-01-09 21:07:50,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-01-09 21:07:50,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-01-09 21:07:50,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-01-09 21:07:50,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-01-09 21:07:50,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-01-09 21:07:50,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-01-09 21:07:50,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-01-09 21:07:50,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-01-09 21:07:50,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-01-09 21:07:50,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:07:50,659 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:07:50,662 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:07:50,662 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:07:50,687 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:07:50,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 161 transitions, 340 flow [2025-01-09 21:07:50,710 INFO L124 PetriNetUnfolderBase]: 18/311 cut-off events. [2025-01-09 21:07:50,711 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:07:50,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 311 events. 18/311 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1208 event pairs, 0 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 234. Up to 8 conditions per place. [2025-01-09 21:07:50,712 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 161 transitions, 340 flow [2025-01-09 21:07:50,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 161 transitions, 340 flow [2025-01-09 21:07:50,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:07:50,715 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;@33b5570f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:07:50,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-09 21:07:50,718 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:07:50,718 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2025-01-09 21:07:50,718 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:07:50,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:50,718 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] [2025-01-09 21:07:50,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:07:50,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:50,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1342743370, now seen corresponding path program 1 times [2025-01-09 21:07:50,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:50,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132840900] [2025-01-09 21:07:50,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:50,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:50,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:07:50,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:07:50,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:50,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:50,737 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:07:50,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:50,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132840900] [2025-01-09 21:07:50,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132840900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:50,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:50,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:50,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190920848] [2025-01-09 21:07:50,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:50,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:07:50,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:50,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:07:50,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:07:50,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 161 [2025-01-09 21:07:50,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 161 transitions, 340 flow. Second operand has 2 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 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:07:50,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:50,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 161 [2025-01-09 21:07:50,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:51,041 INFO L124 PetriNetUnfolderBase]: 178/1732 cut-off events. [2025-01-09 21:07:51,041 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-01-09 21:07:51,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2081 conditions, 1732 events. 178/1732 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 14498 event pairs, 178 based on Foata normal form. 260/1709 useless extension candidates. Maximal degree in co-relation 1375. Up to 298 conditions per place. [2025-01-09 21:07:51,051 INFO L140 encePairwiseOnDemand]: 152/161 looper letters, 11 selfloop transitions, 0 changer transitions 0/144 dead transitions. [2025-01-09 21:07:51,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 328 flow [2025-01-09 21:07:51,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:07:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:07:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2025-01-09 21:07:51,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2025-01-09 21:07:51,053 INFO L175 Difference]: Start difference. First operand has 159 places, 161 transitions, 340 flow. Second operand 2 states and 294 transitions. [2025-01-09 21:07:51,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 144 transitions, 328 flow [2025-01-09 21:07:51,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 144 transitions, 326 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:51,055 INFO L231 Difference]: Finished difference. Result has 152 places, 144 transitions, 304 flow [2025-01-09 21:07:51,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=304, PETRI_PLACES=152, PETRI_TRANSITIONS=144} [2025-01-09 21:07:51,055 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, -7 predicate places. [2025-01-09 21:07:51,056 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 144 transitions, 304 flow [2025-01-09 21:07:51,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 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:07:51,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:51,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:07:51,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:07:51,056 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:07:51,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:51,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1379637707, now seen corresponding path program 1 times [2025-01-09 21:07:51,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:51,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530257637] [2025-01-09 21:07:51,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:51,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:51,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:07:51,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:07:51,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:51,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:51,079 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:07:51,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:51,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530257637] [2025-01-09 21:07:51,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530257637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:51,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:51,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:51,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806813623] [2025-01-09 21:07:51,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:51,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:51,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:51,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:51,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:51,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2025-01-09 21:07:51,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 144 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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:07:51,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:51,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2025-01-09 21:07:51,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:52,616 INFO L124 PetriNetUnfolderBase]: 8153/23044 cut-off events. [2025-01-09 21:07:52,617 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-01-09 21:07:52,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34911 conditions, 23044 events. 8153/23044 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 266242 event pairs, 6332 based on Foata normal form. 0/19799 useless extension candidates. Maximal degree in co-relation 34905. Up to 10488 conditions per place. [2025-01-09 21:07:52,878 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 34 selfloop transitions, 12 changer transitions 0/161 dead transitions. [2025-01-09 21:07:52,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 161 transitions, 430 flow [2025-01-09 21:07:52,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2025-01-09 21:07:52,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8364389233954451 [2025-01-09 21:07:52,881 INFO L175 Difference]: Start difference. First operand has 152 places, 144 transitions, 304 flow. Second operand 3 states and 404 transitions. [2025-01-09 21:07:52,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 161 transitions, 430 flow [2025-01-09 21:07:52,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 161 transitions, 430 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:52,883 INFO L231 Difference]: Finished difference. Result has 156 places, 155 transitions, 398 flow [2025-01-09 21:07:52,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=156, PETRI_TRANSITIONS=155} [2025-01-09 21:07:52,884 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, -3 predicate places. [2025-01-09 21:07:52,884 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 155 transitions, 398 flow [2025-01-09 21:07:52,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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:07:52,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:52,885 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:07:52,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:07:52,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:07:52,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:52,886 INFO L85 PathProgramCache]: Analyzing trace with hash -652381915, now seen corresponding path program 1 times [2025-01-09 21:07:52,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:52,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9821597] [2025-01-09 21:07:52,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:52,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:52,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:07:52,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:07:52,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:52,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:52,912 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:07:52,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:52,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9821597] [2025-01-09 21:07:52,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9821597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:52,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:52,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:52,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280930980] [2025-01-09 21:07:52,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:52,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:52,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:52,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:52,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:52,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2025-01-09 21:07:52,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 155 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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:07:52,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:52,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2025-01-09 21:07:52,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:54,668 INFO L124 PetriNetUnfolderBase]: 11247/29861 cut-off events. [2025-01-09 21:07:54,668 INFO L125 PetriNetUnfolderBase]: For 7872/9087 co-relation queries the response was YES. [2025-01-09 21:07:54,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56111 conditions, 29861 events. 11247/29861 cut-off events. For 7872/9087 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 351460 event pairs, 6418 based on Foata normal form. 28/25419 useless extension candidates. Maximal degree in co-relation 56103. Up to 13140 conditions per place. [2025-01-09 21:07:54,836 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 42 selfloop transitions, 19 changer transitions 0/180 dead transitions. [2025-01-09 21:07:54,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 180 transitions, 620 flow [2025-01-09 21:07:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:54,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2025-01-09 21:07:54,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488612836438924 [2025-01-09 21:07:54,837 INFO L175 Difference]: Start difference. First operand has 156 places, 155 transitions, 398 flow. Second operand 3 states and 410 transitions. [2025-01-09 21:07:54,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 180 transitions, 620 flow [2025-01-09 21:07:54,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 180 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:07:54,886 INFO L231 Difference]: Finished difference. Result has 158 places, 172 transitions, 546 flow [2025-01-09 21:07:54,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=158, PETRI_TRANSITIONS=172} [2025-01-09 21:07:54,886 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, -1 predicate places. [2025-01-09 21:07:54,887 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 172 transitions, 546 flow [2025-01-09 21:07:54,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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:07:54,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:54,887 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] [2025-01-09 21:07:54,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:07:54,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:07:54,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:54,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2049592448, now seen corresponding path program 1 times [2025-01-09 21:07:54,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:54,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721785729] [2025-01-09 21:07:54,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:54,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:54,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:07:54,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:07:54,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:54,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:54,910 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:07:54,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:54,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721785729] [2025-01-09 21:07:54,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721785729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:54,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:54,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:54,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141778446] [2025-01-09 21:07:54,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:54,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:54,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:54,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:54,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:54,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 161 [2025-01-09 21:07:54,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 172 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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:07:54,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:54,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 161 [2025-01-09 21:07:54,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:57,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][151], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, 16#L693-6true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 70#L693-7true, 169#true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 176#(= |#race~c~0| 0), 158#true]) [2025-01-09 21:07:57,619 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:07:57,619 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:07:57,619 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:07:57,619 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:07:57,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][214], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 106#L693-4true, 156#true, 162#true, 160#true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 169#true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 55#L693-14true]) [2025-01-09 21:07:57,818 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:07:57,818 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:07:57,818 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:07:57,818 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:07:57,832 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][198], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 106#L693-4true, 156#true, 162#true, 160#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 169#true, 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true]) [2025-01-09 21:07:57,833 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:07:57,833 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:07:57,833 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:07:57,833 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:07:58,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][123], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 156#true, 162#true, 160#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 169#true, 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true]) [2025-01-09 21:07:58,100 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-01-09 21:07:58,100 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:07:58,100 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:07:58,100 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:07:58,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][174], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 156#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 70#L693-7true, 169#true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 55#L693-14true, 158#true]) [2025-01-09 21:07:58,101 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-01-09 21:07:58,101 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:07:58,101 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:07:58,101 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:00,108 INFO L124 PetriNetUnfolderBase]: 31793/78596 cut-off events. [2025-01-09 21:08:00,109 INFO L125 PetriNetUnfolderBase]: For 55456/57152 co-relation queries the response was YES. [2025-01-09 21:08:00,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170883 conditions, 78596 events. 31793/78596 cut-off events. For 55456/57152 co-relation queries the response was YES. Maximal size of possible extension queue 2895. Compared 1028865 event pairs, 10563 based on Foata normal form. 71/64794 useless extension candidates. Maximal degree in co-relation 170874. Up to 24669 conditions per place. [2025-01-09 21:08:00,856 INFO L140 encePairwiseOnDemand]: 141/161 looper letters, 65 selfloop transitions, 40 changer transitions 0/222 dead transitions. [2025-01-09 21:08:00,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 222 transitions, 1028 flow [2025-01-09 21:08:00,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:08:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:08:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2025-01-09 21:08:00,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8530020703933747 [2025-01-09 21:08:00,862 INFO L175 Difference]: Start difference. First operand has 158 places, 172 transitions, 546 flow. Second operand 3 states and 412 transitions. [2025-01-09 21:08:00,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 222 transitions, 1028 flow [2025-01-09 21:08:01,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 222 transitions, 956 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:08:01,036 INFO L231 Difference]: Finished difference. Result has 160 places, 212 transitions, 964 flow [2025-01-09 21:08:01,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=160, PETRI_TRANSITIONS=212} [2025-01-09 21:08:01,036 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 1 predicate places. [2025-01-09 21:08:01,036 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 212 transitions, 964 flow [2025-01-09 21:08:01,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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:08:01,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:08:01,037 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] [2025-01-09 21:08:01,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:08:01,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:08:01,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:08:01,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1117522883, now seen corresponding path program 1 times [2025-01-09 21:08:01,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:08:01,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131745446] [2025-01-09 21:08:01,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:08:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:08:01,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:08:01,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:08:01,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:08:01,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:08:01,064 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:08:01,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:08:01,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131745446] [2025-01-09 21:08:01,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131745446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:08:01,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:08:01,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:08:01,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942441853] [2025-01-09 21:08:01,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:08:01,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:08:01,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:08:01,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:08:01,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:08:01,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2025-01-09 21:08:01,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 212 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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:08:01,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:08:01,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2025-01-09 21:08:01,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:08:03,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][144], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 86#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 115#L693-7true, Black: 174#true, 179#true, 156#true, 160#true, 176#(= |#race~c~0| 0)]) [2025-01-09 21:08:03,182 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2025-01-09 21:08:03,183 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-01-09 21:08:03,183 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-01-09 21:08:03,183 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-01-09 21:08:03,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][145], [162#true, 16#L693-6true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 107#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 179#true, 156#true, 160#true, 176#(= |#race~c~0| 0)]) [2025-01-09 21:08:03,196 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2025-01-09 21:08:03,196 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-01-09 21:08:03,196 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-01-09 21:08:03,196 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-01-09 21:08:03,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][193], [162#true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-3true, 174#true, 158#true, 115#L693-7true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 160#true]) [2025-01-09 21:08:03,280 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,280 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,280 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,281 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][216], [162#true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-3true, 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 179#true, 156#true, 160#true]) [2025-01-09 21:08:03,288 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,288 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,288 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,288 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][163], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 115#L693-7true, 156#true, 179#true, 90#L693-4true, 160#true]) [2025-01-09 21:08:03,462 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,462 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,462 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,462 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][197], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-7true, 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 179#true, 156#true, 160#true]) [2025-01-09 21:08:03,486 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,486 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,486 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,486 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][157], [162#true, 88#L692-3true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 179#true, 156#true, 39#L693-14true, 160#true]) [2025-01-09 21:08:03,535 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,535 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,535 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,535 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:03,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][70], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 156#true, 179#true, 39#L693-14true, 160#true]) [2025-01-09 21:08:03,873 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-01-09 21:08:03,874 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:08:03,874 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:08:03,874 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:08:04,045 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 115#L693-7true, 179#true, 156#true, 160#true]) [2025-01-09 21:08:04,045 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-01-09 21:08:04,045 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:08:04,045 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:08:04,045 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:08:04,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-7true, 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 179#true, 156#true, 160#true]) [2025-01-09 21:08:04,061 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-01-09 21:08:04,061 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:08:04,061 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:08:04,061 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:08:04,249 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][159], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 118#L693-3true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 57#L693-5true, 115#L693-7true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true]) [2025-01-09 21:08:04,249 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2025-01-09 21:08:04,249 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-01-09 21:08:04,249 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-01-09 21:08:04,249 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-01-09 21:08:04,262 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][159], [162#true, 70#L693-7true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-3true, 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 179#true, 156#true, 160#true]) [2025-01-09 21:08:04,263 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2025-01-09 21:08:04,263 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-01-09 21:08:04,263 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-01-09 21:08:04,263 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-01-09 21:08:04,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][145], [162#true, 16#L693-6true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 160#true, 176#(= |#race~c~0| 0)]) [2025-01-09 21:08:04,570 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:08:04,570 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:04,570 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:04,570 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:04,595 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][144], [162#true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 174#true, 179#true, 156#true, 160#true, 176#(= |#race~c~0| 0)]) [2025-01-09 21:08:04,596 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:08:04,596 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:04,596 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:04,596 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:05,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][200], [162#true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 90#L693-4true, 160#true, 55#L693-14true]) [2025-01-09 21:08:05,049 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:08:05,050 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:05,050 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:05,050 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:05,050 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][221], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 106#L693-4true, 179#true, 156#true, 160#true, 55#L693-14true]) [2025-01-09 21:08:05,050 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:08:05,050 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:05,050 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:05,050 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:05,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][163], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 160#true]) [2025-01-09 21:08:05,061 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:08:05,061 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:05,061 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:05,061 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:05,067 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][197], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 160#true]) [2025-01-09 21:08:05,067 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:08:05,067 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:05,067 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:05,067 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:05,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 156#true, 179#true, 160#true]) [2025-01-09 21:08:05,429 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-01-09 21:08:05,429 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:05,429 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:05,429 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:05,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][172], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 179#true, 156#true, 160#true, 55#L693-14true]) [2025-01-09 21:08:05,430 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-01-09 21:08:05,430 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:05,430 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:05,430 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:05,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, 108#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true]) [2025-01-09 21:08:05,447 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-01-09 21:08:05,447 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:05,447 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:05,447 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:05,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][172], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 174#true, 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true, 55#L693-14true]) [2025-01-09 21:08:05,448 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-01-09 21:08:05,448 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:05,448 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:05,448 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:07,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][163], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 160#true]) [2025-01-09 21:08:07,776 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-01-09 21:08:07,776 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:07,776 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:07,776 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:07,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][200], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 160#true, 55#L693-14true]) [2025-01-09 21:08:07,777 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-01-09 21:08:07,777 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:07,778 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:07,778 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:07,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][172], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 160#true, 55#L693-14true]) [2025-01-09 21:08:07,930 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-01-09 21:08:07,930 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:07,930 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:07,930 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:07,930 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 160#true]) [2025-01-09 21:08:07,930 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-01-09 21:08:07,930 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:07,930 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:07,930 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:08,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][163], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 28#L701-3true, 160#true]) [2025-01-09 21:08:08,293 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-01-09 21:08:08,293 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:08:08,293 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:08:08,293 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:08:08,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][200], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 28#L701-3true, 160#true, 55#L693-14true]) [2025-01-09 21:08:08,294 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-01-09 21:08:08,295 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:08:08,295 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:08:08,295 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:08:08,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 160#true, 28#L701-3true]) [2025-01-09 21:08:08,591 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-01-09 21:08:08,591 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:08:08,591 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:08:08,591 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:08:08,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][172], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 28#L701-3true, 160#true, 55#L693-14true]) [2025-01-09 21:08:08,596 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-01-09 21:08:08,596 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:08:08,596 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:08:08,596 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:08:09,048 INFO L124 PetriNetUnfolderBase]: 45373/113850 cut-off events. [2025-01-09 21:08:09,051 INFO L125 PetriNetUnfolderBase]: For 212666/218669 co-relation queries the response was YES. [2025-01-09 21:08:09,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305572 conditions, 113850 events. 45373/113850 cut-off events. For 212666/218669 co-relation queries the response was YES. Maximal size of possible extension queue 3851. Compared 1550772 event pairs, 17101 based on Foata normal form. 381/95004 useless extension candidates. Maximal degree in co-relation 305562. Up to 49200 conditions per place. [2025-01-09 21:08:10,052 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 91 selfloop transitions, 36 changer transitions 0/250 dead transitions. [2025-01-09 21:08:10,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 250 transitions, 1496 flow [2025-01-09 21:08:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:08:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:08:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2025-01-09 21:08:10,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8364389233954451 [2025-01-09 21:08:10,054 INFO L175 Difference]: Start difference. First operand has 160 places, 212 transitions, 964 flow. Second operand 3 states and 404 transitions. [2025-01-09 21:08:10,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 250 transitions, 1496 flow [2025-01-09 21:08:10,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 250 transitions, 1386 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:08:10,151 INFO L231 Difference]: Finished difference. Result has 162 places, 244 transitions, 1330 flow [2025-01-09 21:08:10,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1330, PETRI_PLACES=162, PETRI_TRANSITIONS=244} [2025-01-09 21:08:10,152 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 3 predicate places. [2025-01-09 21:08:10,152 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 244 transitions, 1330 flow [2025-01-09 21:08:10,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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:08:10,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:08:10,152 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:08:10,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:08:10,152 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:08:10,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:08:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash -918908451, now seen corresponding path program 1 times [2025-01-09 21:08:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:08:10,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066765828] [2025-01-09 21:08:10,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:08:10,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:08:10,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:08:10,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:08:10,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:08:10,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:08:10,170 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:08:10,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:08:10,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066765828] [2025-01-09 21:08:10,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066765828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:08:10,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:08:10,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:08:10,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453697526] [2025-01-09 21:08:10,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:08:10,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:08:10,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:08:10,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:08:10,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:08:10,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2025-01-09 21:08:10,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 244 transitions, 1330 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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:08:10,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:08:10,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2025-01-09 21:08:10,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:08:13,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][297], [162#true, 16#L693-6true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2025-01-09 21:08:13,468 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:08:13,468 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:13,468 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:13,468 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:13,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][295], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 106#L693-4true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2025-01-09 21:08:13,477 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:08:13,477 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:13,477 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:13,477 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:13,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][294], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 106#L693-4true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-01-09 21:08:13,481 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:08:13,481 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:13,481 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:13,481 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:13,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][300], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true, 55#L693-14true]) [2025-01-09 21:08:13,585 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:08:13,585 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:08:13,585 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:08:13,585 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:08:14,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][281], [8#L693-5true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 55#L693-14true]) [2025-01-09 21:08:14,275 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,275 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,275 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,275 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][253], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true, 55#L693-14true]) [2025-01-09 21:08:14,292 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,292 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,292 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,293 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][282], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true, 55#L693-14true]) [2025-01-09 21:08:14,297 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,301 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,301 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,301 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][151], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 115#L693-7true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-01-09 21:08:14,920 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,920 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,920 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,920 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][152], [162#true, 16#L693-6true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-01-09 21:08:14,946 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,946 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,946 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:14,946 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:15,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][155], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 115#L693-7true, Black: 174#true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-01-09 21:08:15,026 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:08:15,026 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:15,027 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:15,027 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:15,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][220], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 115#L693-7true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true, 55#L693-14true]) [2025-01-09 21:08:15,044 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,044 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,044 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,044 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][155], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-7true, 151#L693-6true, 108#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-01-09 21:08:15,084 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:08:15,085 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:15,085 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:15,085 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:15,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][220], [162#true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true, 55#L693-14true]) [2025-01-09 21:08:15,091 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,091 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,091 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,091 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][219], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 115#L693-7true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 55#L693-14true]) [2025-01-09 21:08:15,388 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,388 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,388 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,388 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][214], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 52#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 103#L693-4true, 184#true]) [2025-01-09 21:08:15,447 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,447 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,447 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,447 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][173], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 39#L693-14true, 160#true, 103#L693-4true, 184#true]) [2025-01-09 21:08:15,511 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,511 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,511 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,511 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][166], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 52#L693-14true, 158#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 90#L693-4true, Black: 179#true, 160#true, 184#true]) [2025-01-09 21:08:15,543 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,543 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,543 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:15,543 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:08:16,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][68], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 52#L693-14true, 158#true, 57#L693-5true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 184#true]) [2025-01-09 21:08:16,334 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,334 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,334 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,334 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][183], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 57#L693-5true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 115#L693-7true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 55#L693-14true]) [2025-01-09 21:08:16,337 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,337 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,337 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,337 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][70], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 39#L693-14true, 160#true, 184#true]) [2025-01-09 21:08:16,355 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,355 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,355 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,355 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][183], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 55#L693-14true]) [2025-01-09 21:08:16,358 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,358 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,358 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,358 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][68], [8#L693-5true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 52#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 184#true]) [2025-01-09 21:08:16,408 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,409 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,409 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,409 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][183], [8#L693-5true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 115#L693-7true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 55#L693-14true]) [2025-01-09 21:08:16,428 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,428 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,428 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,428 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][70], [8#L693-5true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 39#L693-14true, 160#true, 184#true]) [2025-01-09 21:08:16,451 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,451 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,451 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,451 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][183], [8#L693-5true, 162#true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 55#L693-14true]) [2025-01-09 21:08:16,460 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,460 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,460 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,460 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:08:16,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][313], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 140#L693-15true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2025-01-09 21:08:16,623 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-01-09 21:08:16,623 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-01-09 21:08:16,623 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-01-09 21:08:16,623 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-01-09 21:08:16,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][147], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 118#L693-3true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 96#L694true, 160#true, 184#true]) [2025-01-09 21:08:16,661 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is not cut-off event [2025-01-09 21:08:16,661 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2025-01-09 21:08:16,661 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2025-01-09 21:08:16,661 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2025-01-09 21:08:16,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][311], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 140#L693-15true, 156#true, 179#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-01-09 21:08:16,666 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-01-09 21:08:16,666 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-01-09 21:08:16,666 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-01-09 21:08:16,667 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-01-09 21:08:16,796 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][314], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 140#L693-15true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true, 55#L693-14true]) [2025-01-09 21:08:16,796 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2025-01-09 21:08:16,796 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-01-09 21:08:16,796 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-01-09 21:08:16,796 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-01-09 21:08:16,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][147], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 118#L693-3true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-01-09 21:08:16,964 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is not cut-off event [2025-01-09 21:08:16,964 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2025-01-09 21:08:16,964 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2025-01-09 21:08:16,964 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2025-01-09 21:08:16,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][129], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 87#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 174#true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-01-09 21:08:16,973 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-01-09 21:08:16,973 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-01-09 21:08:16,973 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-01-09 21:08:16,973 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-01-09 21:08:17,304 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][128], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 87#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2025-01-09 21:08:17,304 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-01-09 21:08:17,304 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-01-09 21:08:17,305 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-01-09 21:08:17,305 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-01-09 21:08:17,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][307], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 140#L693-15true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true, 55#L693-14true]) [2025-01-09 21:08:17,448 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-01-09 21:08:17,448 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:08:17,448 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:08:17,448 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:08:17,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][253], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 96#L694true, 160#true, 103#L693-4true, 184#true, 55#L693-14true]) [2025-01-09 21:08:17,525 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-01-09 21:08:17,525 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:08:17,525 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:08:17,525 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:08:17,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][306], [8#L693-5true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 140#L693-15true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 55#L693-14true]) [2025-01-09 21:08:17,537 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-01-09 21:08:17,537 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:08:17,537 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:08:17,537 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:08:18,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][174], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-01-09 21:08:18,888 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-01-09 21:08:18,888 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:18,888 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:18,888 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:18,889 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][219], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 55#L693-14true]) [2025-01-09 21:08:18,889 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-01-09 21:08:18,889 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:18,889 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:18,889 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:08:19,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][256], [162#true, 14#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 134#L694-3true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-3true, 158#true, Black: 176#(= |#race~c~0| 0), 140#L693-15true, 156#true, 179#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-01-09 21:08:19,179 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is not cut-off event [2025-01-09 21:08:19,179 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2025-01-09 21:08:19,179 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2025-01-09 21:08:19,179 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2025-01-09 21:08:20,478 INFO L124 PetriNetUnfolderBase]: 57922/139420 cut-off events. [2025-01-09 21:08:20,478 INFO L125 PetriNetUnfolderBase]: For 333897/353907 co-relation queries the response was YES. [2025-01-09 21:08:21,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401363 conditions, 139420 events. 57922/139420 cut-off events. For 333897/353907 co-relation queries the response was YES. Maximal size of possible extension queue 4969. Compared 1909526 event pairs, 16715 based on Foata normal form. 382/112176 useless extension candidates. Maximal degree in co-relation 401352. Up to 59162 conditions per place. [2025-01-09 21:08:21,946 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 112 selfloop transitions, 76 changer transitions 0/315 dead transitions. [2025-01-09 21:08:21,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 315 transitions, 2301 flow [2025-01-09 21:08:21,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:08:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:08:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2025-01-09 21:08:21,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8467908902691511 [2025-01-09 21:08:21,948 INFO L175 Difference]: Start difference. First operand has 162 places, 244 transitions, 1330 flow. Second operand 3 states and 409 transitions. [2025-01-09 21:08:21,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 315 transitions, 2301 flow [2025-01-09 21:08:24,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 315 transitions, 2097 flow, removed 46 selfloop flow, removed 2 redundant places. [2025-01-09 21:08:24,937 INFO L231 Difference]: Finished difference. Result has 164 places, 308 transitions, 2136 flow [2025-01-09 21:08:24,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2136, PETRI_PLACES=164, PETRI_TRANSITIONS=308} [2025-01-09 21:08:24,938 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 5 predicate places. [2025-01-09 21:08:24,938 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 308 transitions, 2136 flow [2025-01-09 21:08:24,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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:08:24,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:08:24,938 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] [2025-01-09 21:08:24,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:08:24,939 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:08:24,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:08:24,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2100463886, now seen corresponding path program 1 times [2025-01-09 21:08:24,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:08:24,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599723575] [2025-01-09 21:08:24,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:08:24,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:08:24,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:08:24,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:08:24,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:08:24,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:08:24,959 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:08:24,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:08:24,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599723575] [2025-01-09 21:08:24,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599723575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:08:24,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:08:24,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:08:24,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234303005] [2025-01-09 21:08:24,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:08:24,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:08:24,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:08:24,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:08:24,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:08:25,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2025-01-09 21:08:25,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 308 transitions, 2136 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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:08:25,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:08:25,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2025-01-09 21:08:25,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:08:26,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][129], [189#true, 162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 174#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-01-09 21:08:26,400 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-01-09 21:08:26,400 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:08:26,400 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:08:26,400 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:08:26,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][189], [189#true, 162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 106#L693-4true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-01-09 21:08:26,546 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is not cut-off event [2025-01-09 21:08:26,546 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is not cut-off event [2025-01-09 21:08:26,546 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is not cut-off event [2025-01-09 21:08:26,546 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is not cut-off event [2025-01-09 21:08:27,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][217], [8#L693-5true, 189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-3true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 106#L693-4true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-01-09 21:08:27,391 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is not cut-off event [2025-01-09 21:08:27,391 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-01-09 21:08:27,391 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-01-09 21:08:27,391 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-01-09 21:08:27,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][146], [8#L693-5true, 189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-3true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-01-09 21:08:27,410 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is not cut-off event [2025-01-09 21:08:27,410 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-01-09 21:08:27,410 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-01-09 21:08:27,410 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-01-09 21:08:27,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][156], [189#true, 162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-7true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 115#L693-7true, Black: 174#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-01-09 21:08:27,791 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2025-01-09 21:08:27,791 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-01-09 21:08:27,791 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-01-09 21:08:27,791 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-01-09 21:08:28,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][335], [189#true, 162#true, 16#L693-6true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-01-09 21:08:28,110 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,111 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,111 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,111 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,121 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][334], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 106#L693-4true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-01-09 21:08:28,121 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,121 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,121 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,121 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][332], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 106#L693-4true, Black: 174#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-01-09 21:08:28,126 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,126 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,126 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,126 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][339], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true, 55#L693-14true]) [2025-01-09 21:08:28,448 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:08:28,448 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:08:28,448 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:08:28,448 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:08:28,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][68], [8#L693-5true, 189#true, 162#true, 88#L692-3true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 52#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, Black: 179#true, 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-01-09 21:08:28,542 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-01-09 21:08:28,542 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:08:28,542 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:08:28,542 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:08:28,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][153], [189#true, 162#true, 16#L693-6true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 174#true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-01-09 21:08:28,664 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,664 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,664 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,664 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][189], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 174#true, 106#L693-4true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-01-09 21:08:28,667 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,668 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,668 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,668 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][129], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 174#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-01-09 21:08:28,705 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,705 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,705 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,705 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][188], [189#true, 162#true, 16#L693-6true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 174#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-01-09 21:08:28,741 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,742 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,742 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:28,742 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:08:29,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][313], [8#L693-5true, 189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true, 55#L693-14true]) [2025-01-09 21:08:29,072 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:08:29,072 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:29,072 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:29,072 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:29,074 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][233], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true, 55#L693-14true]) [2025-01-09 21:08:29,074 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:08:29,074 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:08:29,074 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:08:29,074 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:08:29,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][267], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true, 55#L693-14true]) [2025-01-09 21:08:29,090 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:08:29,090 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:29,090 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:29,090 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:29,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][314], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true, 55#L693-14true]) [2025-01-09 21:08:29,096 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:08:29,096 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:29,096 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:29,096 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:08:29,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][275], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 106#L693-4true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true, 55#L693-14true]) [2025-01-09 21:08:29,113 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:08:29,114 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:08:29,114 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:08:29,114 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:08:29,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][169], [8#L693-5true, 189#true, 162#true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 118#L693-3true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 115#L693-7true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-01-09 21:08:29,524 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2025-01-09 21:08:29,524 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-01-09 21:08:29,524 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-01-09 21:08:29,524 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event