./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/06_ticket.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/06_ticket.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d21b75ab9211f19b3beb5c83d6d66f0a0906e2f271e4621d3ded70db8a63bb33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:58:18,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:58:18,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:58:18,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:58:18,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:58:18,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:58:18,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:58:18,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:58:18,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:58:18,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:58:18,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:58:18,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:58:18,736 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:58:18,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:58:18,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:58:18,736 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:58:18,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:58:18,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:58:18,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:58:18,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:58:18,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:58:18,737 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:58:18,737 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:58:18,737 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:58:18,737 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:58:18,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:58:18,737 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:58:18,737 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:58:18,737 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:58:18,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:58:18,738 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:58:18,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:58:18,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:58:18,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:58:18,738 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:58:18,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:58:18,739 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:58:18,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:58:18,739 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:58:18,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:58:18,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:58:18,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:58:18,739 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d21b75ab9211f19b3beb5c83d6d66f0a0906e2f271e4621d3ded70db8a63bb33 [2025-03-13 21:58:19,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:58:19,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:58:19,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:58:19,023 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:58:19,024 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:58:19,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/06_ticket.i [2025-03-13 21:58:20,214 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acde7e08d/2d185fdd33964ad5984cb77eda92fc9e/FLAG0e82a9dff [2025-03-13 21:58:20,509 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:58:20,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/06_ticket.i [2025-03-13 21:58:20,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acde7e08d/2d185fdd33964ad5984cb77eda92fc9e/FLAG0e82a9dff [2025-03-13 21:58:20,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acde7e08d/2d185fdd33964ad5984cb77eda92fc9e [2025-03-13 21:58:20,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:58:20,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:58:20,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:58:20,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:58:20,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:58:20,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:58:20" (1/1) ... [2025-03-13 21:58:20,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf32be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:20, skipping insertion in model container [2025-03-13 21:58:20,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:58:20" (1/1) ... [2025-03-13 21:58:20,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:58:20,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:58:20,817 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:58:20,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:58:20,888 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:58:20,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:20 WrapperNode [2025-03-13 21:58:20,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:58:20,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:58:20,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:58:20,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:58:20,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:20" (1/1) ... [2025-03-13 21:58:20,904 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:20" (1/1) ... [2025-03-13 21:58:20,921 INFO L138 Inliner]: procedures = 171, calls = 14, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 95 [2025-03-13 21:58:20,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:58:20,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:58:20,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:58:20,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:58:20,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:20" (1/1) ... [2025-03-13 21:58:20,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:20" (1/1) ... [2025-03-13 21:58:20,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:20" (1/1) ... [2025-03-13 21:58:20,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:20" (1/1) ... [2025-03-13 21:58:20,934 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:20" (1/1) ... [2025-03-13 21:58:20,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:20" (1/1) ... [2025-03-13 21:58:20,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:20" (1/1) ... [2025-03-13 21:58:20,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:20" (1/1) ... [2025-03-13 21:58:20,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:58:20,943 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:58:20,943 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:58:20,943 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:58:20,944 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:20" (1/1) ... [2025-03-13 21:58:20,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:58:20,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:58:20,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:58:20,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:58:20,996 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 21:58:20,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 21:58:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:58:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:58:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:58:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:58:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:58:20,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:58:20,998 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:58:21,092 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:58:21,094 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:58:21,282 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:58:21,284 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:58:21,284 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:58:21,357 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:58:21,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:21 BoogieIcfgContainer [2025-03-13 21:58:21,357 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:58:21,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:58:21,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:58:21,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:58:21,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:58:20" (1/3) ... [2025-03-13 21:58:21,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f875eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:58:21, skipping insertion in model container [2025-03-13 21:58:21,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:20" (2/3) ... [2025-03-13 21:58:21,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f875eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:58:21, skipping insertion in model container [2025-03-13 21:58:21,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:21" (3/3) ... [2025-03-13 21:58:21,365 INFO L128 eAbstractionObserver]: Analyzing ICFG 06_ticket.i [2025-03-13 21:58:21,377 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:58:21,378 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06_ticket.i that has 2 procedures, 98 locations, 1 initial locations, 2 loop locations, and 13 error locations. [2025-03-13 21:58:21,378 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:58:21,439 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:58:21,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 104 transitions, 212 flow [2025-03-13 21:58:21,517 INFO L124 PetriNetUnfolderBase]: 6/111 cut-off events. [2025-03-13 21:58:21,519 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:58:21,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 111 events. 6/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 90. Up to 3 conditions per place. [2025-03-13 21:58:21,524 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 104 transitions, 212 flow [2025-03-13 21:58:21,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 104 transitions, 212 flow [2025-03-13 21:58:21,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:21,551 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;@456f5b43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:21,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-13 21:58:21,561 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:21,561 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-13 21:58:21,561 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:58:21,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:21,562 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:21,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 21:58:21,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:21,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1931106417, now seen corresponding path program 1 times [2025-03-13 21:58:21,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:21,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643643176] [2025-03-13 21:58:21,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:21,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:21,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:58:21,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:58:21,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:21,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:21,662 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:58:21,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:58:21,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:58:21,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:21,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:21,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:58:21,701 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:58:21,702 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 27 remaining) [2025-03-13 21:58:21,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-03-13 21:58:21,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-03-13 21:58:21,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-03-13 21:58:21,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-03-13 21:58:21,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-03-13 21:58:21,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-03-13 21:58:21,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-03-13 21:58:21,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-03-13 21:58:21,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-03-13 21:58:21,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-03-13 21:58:21,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-03-13 21:58:21,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-03-13 21:58:21,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-03-13 21:58:21,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-03-13 21:58:21,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-03-13 21:58:21,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2025-03-13 21:58:21,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2025-03-13 21:58:21,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-03-13 21:58:21,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-03-13 21:58:21,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2025-03-13 21:58:21,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-03-13 21:58:21,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-03-13 21:58:21,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-03-13 21:58:21,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-03-13 21:58:21,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-03-13 21:58:21,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-03-13 21:58:21,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:58:21,710 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-13 21:58:21,712 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:58:21,715 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:58:21,765 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:58:21,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 186 transitions, 382 flow [2025-03-13 21:58:21,818 INFO L124 PetriNetUnfolderBase]: 12/202 cut-off events. [2025-03-13 21:58:21,818 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:58:21,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 202 events. 12/202 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 456 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 171. Up to 3 conditions per place. [2025-03-13 21:58:21,820 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 186 transitions, 382 flow [2025-03-13 21:58:21,823 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 186 transitions, 382 flow [2025-03-13 21:58:21,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:21,824 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;@456f5b43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:21,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-13 21:58:21,829 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:21,830 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-13 21:58:21,830 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:58:21,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:21,830 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] [2025-03-13 21:58:21,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err12ASSERT_VIOLATIONDATA_RACE === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-13 21:58:21,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:21,830 INFO L85 PathProgramCache]: Analyzing trace with hash 690019307, now seen corresponding path program 1 times [2025-03-13 21:58:21,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:21,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847511481] [2025-03-13 21:58:21,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:21,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:21,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:58:21,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:58:21,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:21,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:21,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:21,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:21,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847511481] [2025-03-13 21:58:21,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847511481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:21,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:21,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 21:58:21,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329897696] [2025-03-13 21:58:21,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:21,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:58:21,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:21,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:58:21,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:58:21,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 186 [2025-03-13 21:58:21,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 186 transitions, 382 flow. Second operand has 2 states, 2 states have (on average 162.0) internal successors, (324), 2 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:21,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:21,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 186 [2025-03-13 21:58:21,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:22,014 INFO L124 PetriNetUnfolderBase]: 10/300 cut-off events. [2025-03-13 21:58:22,014 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 21:58:22,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 300 events. 10/300 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1039 event pairs, 2 based on Foata normal form. 23/275 useless extension candidates. Maximal degree in co-relation 215. Up to 9 conditions per place. [2025-03-13 21:58:22,021 INFO L140 encePairwiseOnDemand]: 167/186 looper letters, 4 selfloop transitions, 0 changer transitions 0/160 dead transitions. [2025-03-13 21:58:22,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 160 transitions, 338 flow [2025-03-13 21:58:22,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:58:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:58:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 345 transitions. [2025-03-13 21:58:22,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9274193548387096 [2025-03-13 21:58:22,037 INFO L175 Difference]: Start difference. First operand has 179 places, 186 transitions, 382 flow. Second operand 2 states and 345 transitions. [2025-03-13 21:58:22,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 160 transitions, 338 flow [2025-03-13 21:58:22,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 160 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:22,046 INFO L231 Difference]: Finished difference. Result has 162 places, 160 transitions, 330 flow [2025-03-13 21:58:22,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=330, PETRI_PLACES=162, PETRI_TRANSITIONS=160} [2025-03-13 21:58:22,052 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, -17 predicate places. [2025-03-13 21:58:22,053 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 160 transitions, 330 flow [2025-03-13 21:58:22,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 162.0) internal successors, (324), 2 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:22,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:22,055 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:22,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:58:22,056 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-13 21:58:22,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash -17900900, now seen corresponding path program 1 times [2025-03-13 21:58:22,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:22,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291153726] [2025-03-13 21:58:22,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:22,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:22,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:58:22,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:58:22,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:22,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:22,082 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:58:22,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:58:22,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:58:22,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:22,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:22,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:58:22,103 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (38 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (37 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (36 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (35 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (33 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (32 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (31 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (30 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (28 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (27 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (25 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (24 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 40 remaining) [2025-03-13 21:58:22,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 40 remaining) [2025-03-13 21:58:22,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (21 of 40 remaining) [2025-03-13 21:58:22,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (20 of 40 remaining) [2025-03-13 21:58:22,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (19 of 40 remaining) [2025-03-13 21:58:22,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (18 of 40 remaining) [2025-03-13 21:58:22,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 40 remaining) [2025-03-13 21:58:22,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 40 remaining) [2025-03-13 21:58:22,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 40 remaining) [2025-03-13 21:58:22,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 40 remaining) [2025-03-13 21:58:22,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 40 remaining) [2025-03-13 21:58:22,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (12 of 40 remaining) [2025-03-13 21:58:22,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (11 of 40 remaining) [2025-03-13 21:58:22,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (10 of 40 remaining) [2025-03-13 21:58:22,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 40 remaining) [2025-03-13 21:58:22,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 40 remaining) [2025-03-13 21:58:22,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 40 remaining) [2025-03-13 21:58:22,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 40 remaining) [2025-03-13 21:58:22,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 40 remaining) [2025-03-13 21:58:22,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 40 remaining) [2025-03-13 21:58:22,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 40 remaining) [2025-03-13 21:58:22,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 40 remaining) [2025-03-13 21:58:22,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 40 remaining) [2025-03-13 21:58:22,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 40 remaining) [2025-03-13 21:58:22,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:58:22,107 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 21:58:22,108 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:58:22,108 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 21:58:22,144 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:58:22,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 268 transitions, 554 flow [2025-03-13 21:58:22,186 INFO L124 PetriNetUnfolderBase]: 18/293 cut-off events. [2025-03-13 21:58:22,187 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:58:22,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 293 events. 18/293 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 933 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 252. Up to 4 conditions per place. [2025-03-13 21:58:22,192 INFO L82 GeneralOperation]: Start removeDead. Operand has 257 places, 268 transitions, 554 flow [2025-03-13 21:58:22,195 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 268 transitions, 554 flow [2025-03-13 21:58:22,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:22,197 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;@456f5b43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:22,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-03-13 21:58:22,201 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:22,201 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-13 21:58:22,202 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:58:22,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:22,202 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] [2025-03-13 21:58:22,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err12ASSERT_VIOLATIONDATA_RACE === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-03-13 21:58:22,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:22,202 INFO L85 PathProgramCache]: Analyzing trace with hash 661679100, now seen corresponding path program 1 times [2025-03-13 21:58:22,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:22,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561370982] [2025-03-13 21:58:22,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:22,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:22,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:58:22,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:58:22,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:22,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:22,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:22,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561370982] [2025-03-13 21:58:22,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561370982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:22,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:22,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 21:58:22,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646812706] [2025-03-13 21:58:22,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:22,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:58:22,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:22,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:58:22,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:58:22,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 268 [2025-03-13 21:58:22,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 268 transitions, 554 flow. Second operand has 2 states, 2 states have (on average 232.0) internal successors, (464), 2 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:22,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:22,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 268 [2025-03-13 21:58:22,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:22,360 INFO L124 PetriNetUnfolderBase]: 32/774 cut-off events. [2025-03-13 21:58:22,361 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-13 21:58:22,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 774 events. 32/774 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4707 event pairs, 10 based on Foata normal form. 61/703 useless extension candidates. Maximal degree in co-relation 492. Up to 25 conditions per place. [2025-03-13 21:58:22,369 INFO L140 encePairwiseOnDemand]: 240/268 looper letters, 6 selfloop transitions, 0 changer transitions 0/231 dead transitions. [2025-03-13 21:58:22,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 231 transitions, 492 flow [2025-03-13 21:58:22,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:58:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:58:22,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 496 transitions. [2025-03-13 21:58:22,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9253731343283582 [2025-03-13 21:58:22,374 INFO L175 Difference]: Start difference. First operand has 257 places, 268 transitions, 554 flow. Second operand 2 states and 496 transitions. [2025-03-13 21:58:22,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 231 transitions, 492 flow [2025-03-13 21:58:22,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 231 transitions, 490 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:22,379 INFO L231 Difference]: Finished difference. Result has 233 places, 231 transitions, 478 flow [2025-03-13 21:58:22,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=478, PETRI_PLACES=233, PETRI_TRANSITIONS=231} [2025-03-13 21:58:22,381 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -24 predicate places. [2025-03-13 21:58:22,382 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 231 transitions, 478 flow [2025-03-13 21:58:22,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 232.0) internal successors, (464), 2 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:22,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:22,383 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] [2025-03-13 21:58:22,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:58:22,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-03-13 21:58:22,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:22,385 INFO L85 PathProgramCache]: Analyzing trace with hash -920188151, now seen corresponding path program 1 times [2025-03-13 21:58:22,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:22,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127436292] [2025-03-13 21:58:22,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:22,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:22,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:58:22,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:58:22,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:22,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:22,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:22,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127436292] [2025-03-13 21:58:22,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127436292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:22,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:22,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:22,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506386721] [2025-03-13 21:58:22,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:22,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:22,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:22,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:22,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:22,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 268 [2025-03-13 21:58:22,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 231 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:22,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:22,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 268 [2025-03-13 21:58:22,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:23,258 INFO L124 PetriNetUnfolderBase]: 1088/6875 cut-off events. [2025-03-13 21:58:23,258 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-03-13 21:58:23,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8744 conditions, 6875 events. 1088/6875 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 68823 event pairs, 439 based on Foata normal form. 0/5802 useless extension candidates. Maximal degree in co-relation 8738. Up to 1297 conditions per place. [2025-03-13 21:58:23,317 INFO L140 encePairwiseOnDemand]: 244/268 looper letters, 29 selfloop transitions, 18 changer transitions 0/251 dead transitions. [2025-03-13 21:58:23,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 251 transitions, 622 flow [2025-03-13 21:58:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2025-03-13 21:58:23,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.849502487562189 [2025-03-13 21:58:23,320 INFO L175 Difference]: Start difference. First operand has 233 places, 231 transitions, 478 flow. Second operand 3 states and 683 transitions. [2025-03-13 21:58:23,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 251 transitions, 622 flow [2025-03-13 21:58:23,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 251 transitions, 622 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:23,325 INFO L231 Difference]: Finished difference. Result has 237 places, 249 transitions, 634 flow [2025-03-13 21:58:23,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=237, PETRI_TRANSITIONS=249} [2025-03-13 21:58:23,327 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -20 predicate places. [2025-03-13 21:58:23,327 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 249 transitions, 634 flow [2025-03-13 21:58:23,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:23,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:23,329 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:23,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:58:23,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-03-13 21:58:23,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1458588852, now seen corresponding path program 1 times [2025-03-13 21:58:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:23,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210598440] [2025-03-13 21:58:23,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:23,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:58:23,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:58:23,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:23,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:23,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:58:23,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:58:23,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:58:23,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:23,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:23,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:58:23,358 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:58:23,358 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2025-03-13 21:58:23,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2025-03-13 21:58:23,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2025-03-13 21:58:23,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2025-03-13 21:58:23,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2025-03-13 21:58:23,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2025-03-13 21:58:23,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2025-03-13 21:58:23,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2025-03-13 21:58:23,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2025-03-13 21:58:23,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2025-03-13 21:58:23,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2025-03-13 21:58:23,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2025-03-13 21:58:23,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2025-03-13 21:58:23,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2025-03-13 21:58:23,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2025-03-13 21:58:23,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2025-03-13 21:58:23,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2025-03-13 21:58:23,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2025-03-13 21:58:23,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2025-03-13 21:58:23,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2025-03-13 21:58:23,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2025-03-13 21:58:23,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2025-03-13 21:58:23,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2025-03-13 21:58:23,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2025-03-13 21:58:23,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2025-03-13 21:58:23,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2025-03-13 21:58:23,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2025-03-13 21:58:23,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2025-03-13 21:58:23,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2025-03-13 21:58:23,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2025-03-13 21:58:23,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2025-03-13 21:58:23,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2025-03-13 21:58:23,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2025-03-13 21:58:23,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2025-03-13 21:58:23,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2025-03-13 21:58:23,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2025-03-13 21:58:23,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2025-03-13 21:58:23,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2025-03-13 21:58:23,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2025-03-13 21:58:23,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2025-03-13 21:58:23,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2025-03-13 21:58:23,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2025-03-13 21:58:23,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2025-03-13 21:58:23,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2025-03-13 21:58:23,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2025-03-13 21:58:23,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2025-03-13 21:58:23,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2025-03-13 21:58:23,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2025-03-13 21:58:23,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2025-03-13 21:58:23,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2025-03-13 21:58:23,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2025-03-13 21:58:23,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2025-03-13 21:58:23,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2025-03-13 21:58:23,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:58:23,364 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-13 21:58:23,365 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:58:23,365 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 21:58:23,420 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:58:23,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 335 places, 350 transitions, 728 flow [2025-03-13 21:58:23,480 INFO L124 PetriNetUnfolderBase]: 24/384 cut-off events. [2025-03-13 21:58:23,480 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:58:23,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 384 events. 24/384 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1436 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 333. Up to 5 conditions per place. [2025-03-13 21:58:23,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 335 places, 350 transitions, 728 flow [2025-03-13 21:58:23,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 335 places, 350 transitions, 728 flow [2025-03-13 21:58:23,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:23,501 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;@456f5b43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:23,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2025-03-13 21:58:23,504 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:23,505 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-13 21:58:23,505 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:58:23,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:23,510 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] [2025-03-13 21:58:23,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err12ASSERT_VIOLATIONDATA_RACE === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2025-03-13 21:58:23,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:23,511 INFO L85 PathProgramCache]: Analyzing trace with hash 705332013, now seen corresponding path program 1 times [2025-03-13 21:58:23,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:23,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642642886] [2025-03-13 21:58:23,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:23,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:23,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:58:23,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:58:23,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:23,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:23,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:23,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642642886] [2025-03-13 21:58:23,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642642886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:23,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:23,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 21:58:23,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432369253] [2025-03-13 21:58:23,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:23,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:58:23,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:23,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:58:23,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:58:23,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 350 [2025-03-13 21:58:23,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 350 transitions, 728 flow. Second operand has 2 states, 2 states have (on average 302.0) internal successors, (604), 2 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:23,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:23,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 350 [2025-03-13 21:58:23,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:23,765 INFO L124 PetriNetUnfolderBase]: 86/1784 cut-off events. [2025-03-13 21:58:23,766 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-03-13 21:58:23,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1918 conditions, 1784 events. 86/1784 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 14808 event pairs, 34 based on Foata normal form. 151/1623 useless extension candidates. Maximal degree in co-relation 1049. Up to 65 conditions per place. [2025-03-13 21:58:23,791 INFO L140 encePairwiseOnDemand]: 313/350 looper letters, 8 selfloop transitions, 0 changer transitions 0/302 dead transitions. [2025-03-13 21:58:23,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 302 transitions, 648 flow [2025-03-13 21:58:23,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:58:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:58:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 647 transitions. [2025-03-13 21:58:23,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9242857142857143 [2025-03-13 21:58:23,795 INFO L175 Difference]: Start difference. First operand has 335 places, 350 transitions, 728 flow. Second operand 2 states and 647 transitions. [2025-03-13 21:58:23,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 302 transitions, 648 flow [2025-03-13 21:58:23,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 302 transitions, 642 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:23,800 INFO L231 Difference]: Finished difference. Result has 304 places, 302 transitions, 626 flow [2025-03-13 21:58:23,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=626, PETRI_PLACES=304, PETRI_TRANSITIONS=302} [2025-03-13 21:58:23,801 INFO L279 CegarLoopForPetriNet]: 335 programPoint places, -31 predicate places. [2025-03-13 21:58:23,801 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 302 transitions, 626 flow [2025-03-13 21:58:23,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 302.0) internal successors, (604), 2 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:23,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:23,802 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] [2025-03-13 21:58:23,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:58:23,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2025-03-13 21:58:23,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:23,803 INFO L85 PathProgramCache]: Analyzing trace with hash 76048570, now seen corresponding path program 1 times [2025-03-13 21:58:23,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:23,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900194178] [2025-03-13 21:58:23,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:23,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:23,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:58:23,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:58:23,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:23,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:23,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:23,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900194178] [2025-03-13 21:58:23,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900194178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:23,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:23,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:23,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523217052] [2025-03-13 21:58:23,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:23,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:23,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:23,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:23,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:23,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 350 [2025-03-13 21:58:23,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 302 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:23,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:23,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 350 [2025-03-13 21:58:23,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:30,416 INFO L124 PetriNetUnfolderBase]: 15440/65818 cut-off events. [2025-03-13 21:58:30,417 INFO L125 PetriNetUnfolderBase]: For 2056/2056 co-relation queries the response was YES. [2025-03-13 21:58:30,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88938 conditions, 65818 events. 15440/65818 cut-off events. For 2056/2056 co-relation queries the response was YES. Maximal size of possible extension queue 1205. Compared 923018 event pairs, 6393 based on Foata normal form. 0/55404 useless extension candidates. Maximal degree in co-relation 88931. Up to 16154 conditions per place. [2025-03-13 21:58:31,283 INFO L140 encePairwiseOnDemand]: 318/350 looper letters, 39 selfloop transitions, 24 changer transitions 0/329 dead transitions. [2025-03-13 21:58:31,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 329 transitions, 821 flow [2025-03-13 21:58:31,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 890 transitions. [2025-03-13 21:58:31,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8476190476190476 [2025-03-13 21:58:31,287 INFO L175 Difference]: Start difference. First operand has 304 places, 302 transitions, 626 flow. Second operand 3 states and 890 transitions. [2025-03-13 21:58:31,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 329 transitions, 821 flow [2025-03-13 21:58:31,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 329 transitions, 821 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:31,294 INFO L231 Difference]: Finished difference. Result has 308 places, 326 transitions, 834 flow [2025-03-13 21:58:31,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=308, PETRI_TRANSITIONS=326} [2025-03-13 21:58:31,297 INFO L279 CegarLoopForPetriNet]: 335 programPoint places, -27 predicate places. [2025-03-13 21:58:31,297 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 326 transitions, 834 flow [2025-03-13 21:58:31,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:31,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:31,298 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-03-13 21:58:31,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:58:31,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2025-03-13 21:58:31,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:31,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1183868539, now seen corresponding path program 1 times [2025-03-13 21:58:31,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:31,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765808804] [2025-03-13 21:58:31,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:31,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:31,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:58:31,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:58:31,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:31,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:31,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:31,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:31,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765808804] [2025-03-13 21:58:31,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765808804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:31,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:31,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:31,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952624163] [2025-03-13 21:58:31,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:31,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:31,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:31,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:31,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:31,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 350 [2025-03-13 21:58:31,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 326 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 258.3333333333333) internal successors, (775), 3 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:31,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:31,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 350 [2025-03-13 21:58:31,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:34,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1076] L693-->L704-1: Formula: (and (= |v_#race~now_serving~0_41| 0) (let ((.cse0 (mod (mod (+ v_~next_ticket~0_76 1) 4294967296) 3))) (let ((.cse1 (= .cse0 (mod v_~now_serving~0_26 4294967296)))) (or (and (= .cse0 v_~next_ticket~0_75) (= v_~next_ticket~0_76 |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) (not .cse1)) (and (= v_~next_ticket~0_76 v_~next_ticket~0_75) (= |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6| |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|) (= 3 |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) .cse1 (= |v_#race~next_ticket~0_121| 0)))))) InVars {~now_serving~0=v_~now_serving~0_26, ~next_ticket~0=v_~next_ticket~0_76, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|} OutVars{~now_serving~0=v_~now_serving~0_26, #race~now_serving~0=|v_#race~now_serving~0_41|, ~next_ticket~0=v_~next_ticket~0_75, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1=|v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|, #race~next_ticket~0=|v_#race~next_ticket~0_121|, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6|} AuxVars[] AssignedVars[~next_ticket~0, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1, #race~now_serving~0, #race~next_ticket~0, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1][142], [338#true, 336#true, 172#L728-6true, 233#L713-1true, 191#L704-1true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 48#L713true, 330#true, 55#L734-2true, 342#(= |#race~now_serving~0| 0)]) [2025-03-13 21:58:34,779 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-13 21:58:34,779 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-13 21:58:34,779 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-13 21:58:34,779 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-13 21:58:34,958 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L693-->L704-1: Formula: (and (= |v_#race~now_serving~0_41| 0) (let ((.cse0 (mod (mod (+ v_~next_ticket~0_76 1) 4294967296) 3))) (let ((.cse1 (= .cse0 (mod v_~now_serving~0_26 4294967296)))) (or (and (= .cse0 v_~next_ticket~0_75) (= v_~next_ticket~0_76 |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) (not .cse1)) (and (= 3 |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) (= v_~next_ticket~0_76 v_~next_ticket~0_75) (= |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6| |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|) .cse1 (= |v_#race~next_ticket~0_121| 0)))))) InVars {~now_serving~0=v_~now_serving~0_26, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|, ~next_ticket~0=v_~next_ticket~0_76} OutVars{~now_serving~0=v_~now_serving~0_26, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6|, #race~now_serving~0=|v_#race~now_serving~0_41|, ~next_ticket~0=v_~next_ticket~0_75, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1=|v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|, #race~next_ticket~0=|v_#race~next_ticket~0_121|} AuxVars[] AssignedVars[~next_ticket~0, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1, #race~now_serving~0, #race~next_ticket~0][180], [338#true, 336#true, 18#L704-1true, 172#L728-6true, 233#L713-1true, 211#L713true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:34,959 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-13 21:58:34,959 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-13 21:58:34,959 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-13 21:58:34,959 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-13 21:58:35,089 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1238] L693-->L704-1: Formula: (and (let ((.cse1 (mod (mod (+ v_~next_ticket~0_76 1) 4294967296) 3))) (let ((.cse0 (= .cse1 (mod v_~now_serving~0_26 4294967296)))) (or (and (= |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6| |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|) (= v_~next_ticket~0_76 v_~next_ticket~0_75) (= 3 |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) .cse0 (= |v_#race~next_ticket~0_121| 0)) (and (= .cse1 v_~next_ticket~0_75) (= v_~next_ticket~0_76 |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) (not .cse0))))) (= |v_#race~now_serving~0_41| 0)) InVars {~now_serving~0=v_~now_serving~0_26, ~next_ticket~0=v_~next_ticket~0_76, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|} OutVars{~now_serving~0=v_~now_serving~0_26, #race~now_serving~0=|v_#race~now_serving~0_41|, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1=|v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|, ~next_ticket~0=v_~next_ticket~0_75, #race~next_ticket~0=|v_#race~next_ticket~0_121|, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6|} AuxVars[] AssignedVars[~next_ticket~0, #race~now_serving~0, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1, #race~next_ticket~0, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1][107], [338#true, 336#true, 286#L704-1true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 12#L728-6true, 309#L713-1true, 48#L713true, 330#true, 55#L734-2true, 342#(= |#race~now_serving~0| 0)]) [2025-03-13 21:58:35,089 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-13 21:58:35,089 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-13 21:58:35,089 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-13 21:58:35,089 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-13 21:58:35,166 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L693-->L704-1: Formula: (and (= |v_#race~now_serving~0_41| 0) (let ((.cse0 (mod (mod (+ v_~next_ticket~0_76 1) 4294967296) 3))) (let ((.cse1 (= .cse0 (mod v_~now_serving~0_26 4294967296)))) (or (and (= .cse0 v_~next_ticket~0_75) (= v_~next_ticket~0_76 |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) (not .cse1)) (and (= 3 |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) (= v_~next_ticket~0_76 v_~next_ticket~0_75) (= |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6| |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|) .cse1 (= |v_#race~next_ticket~0_121| 0)))))) InVars {~now_serving~0=v_~now_serving~0_26, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|, ~next_ticket~0=v_~next_ticket~0_76} OutVars{~now_serving~0=v_~now_serving~0_26, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6|, #race~now_serving~0=|v_#race~now_serving~0_41|, ~next_ticket~0=v_~next_ticket~0_75, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1=|v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|, #race~next_ticket~0=|v_#race~next_ticket~0_121|} AuxVars[] AssignedVars[~next_ticket~0, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1, #race~now_serving~0, #race~next_ticket~0][180], [338#true, 9#L728-7true, 336#true, 18#L704-1true, 233#L713-1true, 211#L713true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:35,166 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-03-13 21:58:35,166 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-13 21:58:35,166 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-13 21:58:35,166 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-13 21:58:35,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1076] L693-->L704-1: Formula: (and (= |v_#race~now_serving~0_41| 0) (let ((.cse0 (mod (mod (+ v_~next_ticket~0_76 1) 4294967296) 3))) (let ((.cse1 (= .cse0 (mod v_~now_serving~0_26 4294967296)))) (or (and (= .cse0 v_~next_ticket~0_75) (= v_~next_ticket~0_76 |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) (not .cse1)) (and (= v_~next_ticket~0_76 v_~next_ticket~0_75) (= |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6| |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|) (= 3 |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) .cse1 (= |v_#race~next_ticket~0_121| 0)))))) InVars {~now_serving~0=v_~now_serving~0_26, ~next_ticket~0=v_~next_ticket~0_76, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|} OutVars{~now_serving~0=v_~now_serving~0_26, #race~now_serving~0=|v_#race~now_serving~0_41|, ~next_ticket~0=v_~next_ticket~0_75, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1=|v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|, #race~next_ticket~0=|v_#race~next_ticket~0_121|, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6|} AuxVars[] AssignedVars[~next_ticket~0, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1, #race~now_serving~0, #race~next_ticket~0, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1][142], [338#true, 336#true, 9#L728-7true, 233#L713-1true, 191#L704-1true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 48#L713true, 330#true, 55#L734-2true, 342#(= |#race~now_serving~0| 0)]) [2025-03-13 21:58:35,174 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-03-13 21:58:35,174 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-13 21:58:35,174 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-13 21:58:35,174 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-13 21:58:35,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1238] L693-->L704-1: Formula: (and (let ((.cse1 (mod (mod (+ v_~next_ticket~0_76 1) 4294967296) 3))) (let ((.cse0 (= .cse1 (mod v_~now_serving~0_26 4294967296)))) (or (and (= |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6| |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|) (= v_~next_ticket~0_76 v_~next_ticket~0_75) (= 3 |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) .cse0 (= |v_#race~next_ticket~0_121| 0)) (and (= .cse1 v_~next_ticket~0_75) (= v_~next_ticket~0_76 |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) (not .cse0))))) (= |v_#race~now_serving~0_41| 0)) InVars {~now_serving~0=v_~now_serving~0_26, ~next_ticket~0=v_~next_ticket~0_76, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|} OutVars{~now_serving~0=v_~now_serving~0_26, #race~now_serving~0=|v_#race~now_serving~0_41|, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1=|v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|, ~next_ticket~0=v_~next_ticket~0_75, #race~next_ticket~0=|v_#race~next_ticket~0_121|, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6|} AuxVars[] AssignedVars[~next_ticket~0, #race~now_serving~0, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1, #race~next_ticket~0, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1][107], [338#true, 336#true, 286#L704-1true, 328#L728-7true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 309#L713-1true, 48#L713true, 330#true, 55#L734-2true, 342#(= |#race~now_serving~0| 0)]) [2025-03-13 21:58:35,312 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-03-13 21:58:35,312 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-13 21:58:35,312 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-13 21:58:35,312 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-13 21:58:35,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 193#L727-1true, 286#L704-1true, 260#L726-6true, 211#L713true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:35,654 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2025-03-13 21:58:35,654 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-13 21:58:35,654 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-13 21:58:35,654 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-13 21:58:35,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1094] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][219], [338#true, 336#true, 172#L728-6true, 190#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 257#L704-1true, 45#L713-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:35,902 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2025-03-13 21:58:35,902 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-13 21:58:35,902 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-13 21:58:35,902 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-13 21:58:36,167 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1094] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][219], [338#true, 336#true, 9#L728-7true, 190#L726-6true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 257#L704-1true, 45#L713-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:36,167 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-03-13 21:58:36,167 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-13 21:58:36,167 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-13 21:58:36,167 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-13 21:58:36,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 286#L704-1true, 260#L726-6true, 211#L713true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 12#L728-6true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:36,391 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-03-13 21:58:36,391 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-13 21:58:36,391 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-13 21:58:36,391 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-13 21:58:36,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 9#L728-7true, 211#L713true, 260#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 257#L704-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:36,714 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-03-13 21:58:36,714 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-13 21:58:36,714 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-13 21:58:36,714 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-13 21:58:36,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 286#L704-1true, 328#L728-7true, 260#L726-6true, 211#L713true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:36,792 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-03-13 21:58:36,792 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-13 21:58:36,792 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-03-13 21:58:36,792 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-13 21:58:41,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1094] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][219], [338#true, 336#true, 172#L728-6true, 190#L726-6true, 105#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 45#L713-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:41,670 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-03-13 21:58:41,670 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-13 21:58:41,670 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-13 21:58:41,670 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-13 21:58:42,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1094] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][219], [338#true, 336#true, 172#L728-6true, 190#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 244#L726-7true, 45#L713-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:42,484 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-03-13 21:58:42,484 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-13 21:58:42,485 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-13 21:58:42,485 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-13 21:58:42,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1094] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][219], [338#true, 9#L728-7true, 336#true, 190#L726-6true, 105#L726-6true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 45#L713-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:42,498 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-03-13 21:58:42,498 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-13 21:58:42,498 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-13 21:58:42,498 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-13 21:58:43,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1094] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][219], [338#true, 336#true, 9#L728-7true, 190#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 244#L726-7true, 45#L713-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:43,294 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2025-03-13 21:58:43,294 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-13 21:58:43,295 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-13 21:58:43,295 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-13 21:58:43,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 9#L728-7true, 336#true, 105#L726-6true, 211#L713true, 260#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:43,309 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2025-03-13 21:58:43,309 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-13 21:58:43,309 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-13 21:58:43,309 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-13 21:58:44,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 9#L728-7true, 211#L713true, 260#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 244#L726-7true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:44,072 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-03-13 21:58:44,072 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-13 21:58:44,072 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-13 21:58:44,072 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-13 21:58:44,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 328#L728-7true, 260#L726-6true, 334#true, 347#(= |#race~c~0| 0), 74#L726-6true, 332#true, Black: 340#true, 309#L713-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:44,236 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2025-03-13 21:58:44,236 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-13 21:58:44,236 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-13 21:58:44,236 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-13 21:58:44,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 328#L728-7true, 260#L726-6true, 211#L713true, 347#(= |#race~c~0| 0), 334#true, 74#L726-6true, 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:44,818 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-03-13 21:58:44,818 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-13 21:58:44,818 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-13 21:58:44,818 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-13 21:58:45,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 328#L728-7true, 260#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 309#L713-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true, 256#L726-7true]) [2025-03-13 21:58:45,182 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-03-13 21:58:45,182 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-13 21:58:45,182 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-13 21:58:45,182 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-13 21:58:45,903 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 328#L728-7true, 211#L713true, 260#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 330#true, 256#L726-7true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:45,903 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2025-03-13 21:58:45,903 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-13 21:58:45,903 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-03-13 21:58:45,903 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-13 21:58:56,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 193#L727-1true, 286#L704-1true, 260#L726-6true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true, 287#L721-6true]) [2025-03-13 21:58:56,385 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2025-03-13 21:58:56,385 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 21:58:56,385 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 21:58:56,385 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 21:58:57,827 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 172#L728-6true, 260#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 257#L704-1true, 330#true, 287#L721-6true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:58:57,827 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-13 21:58:57,827 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-13 21:58:57,827 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-13 21:58:57,827 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-13 21:58:58,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 286#L704-1true, 260#L726-6true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 12#L728-6true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true, 287#L721-6true]) [2025-03-13 21:58:58,021 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-13 21:58:58,021 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-13 21:58:58,021 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-13 21:58:58,021 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-13 21:59:00,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 9#L728-7true, 260#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 257#L704-1true, 330#true, 287#L721-6true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-13 21:59:00,895 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2025-03-13 21:59:00,895 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 21:59:00,895 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 21:59:00,895 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 21:59:01,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 286#L704-1true, 328#L728-7true, 260#L726-6true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true, 287#L721-6true]) [2025-03-13 21:59:01,027 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2025-03-13 21:59:01,027 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 21:59:01,027 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 21:59:01,027 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event