./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/06_ticket.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d21b75ab9211f19b3beb5c83d6d66f0a0906e2f271e4621d3ded70db8a63bb33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:10:00,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:10:00,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:10:00,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:10:00,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:10:00,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:10:00,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:10:00,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:10:00,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:10:00,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:10:00,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:10:00,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:10:00,244 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:10:00,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:10:00,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:10:00,244 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:10:00,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:10:00,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:10:00,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:10:00,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:10:00,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:10:00,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:10:00,246 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:10:00,246 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:10:00,246 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:10:00,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:10:00,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:10:00,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:10:00,246 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:10:00,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:10:00,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:10:00,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:10:00,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:10:00,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:10:00,247 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:10:00,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:10:00,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:10:00,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:10:00,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:10:00,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:10:00,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:10:00,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:10:00,247 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d21b75ab9211f19b3beb5c83d6d66f0a0906e2f271e4621d3ded70db8a63bb33 [2025-02-08 05:10:00,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:10:00,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:10:00,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:10:00,510 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:10:00,510 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:10:00,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/06_ticket.i [2025-02-08 05:10:01,841 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a9046b84/0570c94dc175474697a1bc61cfff644e/FLAGd6339ad4b [2025-02-08 05:10:02,159 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:10:02,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/06_ticket.i [2025-02-08 05:10:02,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a9046b84/0570c94dc175474697a1bc61cfff644e/FLAGd6339ad4b [2025-02-08 05:10:02,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a9046b84/0570c94dc175474697a1bc61cfff644e [2025-02-08 05:10:02,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:10:02,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:10:02,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:10:02,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:10:02,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:10:02,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:10:02" (1/1) ... [2025-02-08 05:10:02,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2160fcf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:02, skipping insertion in model container [2025-02-08 05:10:02,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:10:02" (1/1) ... [2025-02-08 05:10:02,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:10:02,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:10:02,553 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:10:02,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:10:02,620 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:10:02,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:02 WrapperNode [2025-02-08 05:10:02,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:10:02,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:10:02,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:10:02,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:10:02,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:02" (1/1) ... [2025-02-08 05:10:02,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:02" (1/1) ... [2025-02-08 05:10:02,649 INFO L138 Inliner]: procedures = 171, calls = 14, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 95 [2025-02-08 05:10:02,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:10:02,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:10:02,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:10:02,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:10:02,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:02" (1/1) ... [2025-02-08 05:10:02,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:02" (1/1) ... [2025-02-08 05:10:02,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:02" (1/1) ... [2025-02-08 05:10:02,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:02" (1/1) ... [2025-02-08 05:10:02,660 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:02" (1/1) ... [2025-02-08 05:10:02,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:02" (1/1) ... [2025-02-08 05:10:02,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:02" (1/1) ... [2025-02-08 05:10:02,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:02" (1/1) ... [2025-02-08 05:10:02,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:10:02,668 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:10:02,668 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:10:02,669 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:10:02,669 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:02" (1/1) ... [2025-02-08 05:10:02,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:10:02,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:10:02,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:10:02,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:10:02,717 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:10:02,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:10:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:10:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:10:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:10:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:10:02,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:10:02,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:10:02,720 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:10:02,815 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:10:02,817 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:10:03,007 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:10:03,007 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:10:03,081 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:10:03,081 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:10:03,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:10:03 BoogieIcfgContainer [2025-02-08 05:10:03,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:10:03,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:10:03,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:10:03,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:10:03,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:10:02" (1/3) ... [2025-02-08 05:10:03,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ea1613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:10:03, skipping insertion in model container [2025-02-08 05:10:03,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:02" (2/3) ... [2025-02-08 05:10:03,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ea1613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:10:03, skipping insertion in model container [2025-02-08 05:10:03,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:10:03" (3/3) ... [2025-02-08 05:10:03,091 INFO L128 eAbstractionObserver]: Analyzing ICFG 06_ticket.i [2025-02-08 05:10:03,105 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:10:03,106 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-02-08 05:10:03,108 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:10:03,190 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:03,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 104 transitions, 212 flow [2025-02-08 05:10:03,285 INFO L124 PetriNetUnfolderBase]: 6/111 cut-off events. [2025-02-08 05:10:03,289 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:03,292 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 133 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-02-08 05:10:03,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 104 transitions, 212 flow [2025-02-08 05:10:03,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 104 transitions, 212 flow [2025-02-08 05:10:03,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:03,313 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;@4e961b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:03,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-02-08 05:10:03,323 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:03,323 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-02-08 05:10:03,323 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:03,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:03,324 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-02-08 05:10:03,324 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-02-08 05:10:03,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:03,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1108402816, now seen corresponding path program 1 times [2025-02-08 05:10:03,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:03,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779445586] [2025-02-08 05:10:03,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:03,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:03,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:10:03,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:10:03,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:03,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:03,424 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:10:03,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:10:03,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:10:03,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:03,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:03,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:10:03,466 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:10:03,467 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 27 remaining) [2025-02-08 05:10:03,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-02-08 05:10:03,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-02-08 05:10:03,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-02-08 05:10:03,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-02-08 05:10:03,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-02-08 05:10:03,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-02-08 05:10:03,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-02-08 05:10:03,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-02-08 05:10:03,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-02-08 05:10:03,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-02-08 05:10:03,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-02-08 05:10:03,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-02-08 05:10:03,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-02-08 05:10:03,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-02-08 05:10:03,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-02-08 05:10:03,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2025-02-08 05:10:03,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2025-02-08 05:10:03,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-02-08 05:10:03,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-02-08 05:10:03,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2025-02-08 05:10:03,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-02-08 05:10:03,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-02-08 05:10:03,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-02-08 05:10:03,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-02-08 05:10:03,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-02-08 05:10:03,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-02-08 05:10:03,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:10:03,475 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-08 05:10:03,480 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:10:03,480 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:10:03,541 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:03,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 186 transitions, 382 flow [2025-02-08 05:10:03,616 INFO L124 PetriNetUnfolderBase]: 12/202 cut-off events. [2025-02-08 05:10:03,616 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:10:03,620 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 10. Compared 461 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-02-08 05:10:03,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 186 transitions, 382 flow [2025-02-08 05:10:03,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 186 transitions, 382 flow [2025-02-08 05:10:03,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:03,625 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;@4e961b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:03,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-02-08 05:10:03,631 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:03,632 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-02-08 05:10:03,632 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:10:03,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:03,632 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-02-08 05:10:03,632 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-02-08 05:10:03,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash -476719174, now seen corresponding path program 1 times [2025-02-08 05:10:03,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:03,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401936321] [2025-02-08 05:10:03,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:03,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:03,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:10:03,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:10:03,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:03,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:03,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:03,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401936321] [2025-02-08 05:10:03,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401936321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:03,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:03,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:10:03,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294860405] [2025-02-08 05:10:03,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:03,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:10:03,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:03,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:10:03,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:10:03,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 186 [2025-02-08 05:10:03,769 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-02-08 05:10:03,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:03,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 186 [2025-02-08 05:10:03,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:03,847 INFO L124 PetriNetUnfolderBase]: 10/300 cut-off events. [2025-02-08 05:10:03,847 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:10:03,849 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 1040 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-02-08 05:10:03,853 INFO L140 encePairwiseOnDemand]: 167/186 looper letters, 4 selfloop transitions, 0 changer transitions 0/160 dead transitions. [2025-02-08 05:10:03,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 160 transitions, 338 flow [2025-02-08 05:10:03,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:10:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:10:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 345 transitions. [2025-02-08 05:10:03,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9274193548387096 [2025-02-08 05:10:03,870 INFO L175 Difference]: Start difference. First operand has 179 places, 186 transitions, 382 flow. Second operand 2 states and 345 transitions. [2025-02-08 05:10:03,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 160 transitions, 338 flow [2025-02-08 05:10:03,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 160 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:03,879 INFO L231 Difference]: Finished difference. Result has 162 places, 160 transitions, 330 flow [2025-02-08 05:10:03,881 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-02-08 05:10:03,884 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, -17 predicate places. [2025-02-08 05:10:03,885 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 160 transitions, 330 flow [2025-02-08 05:10:03,886 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-02-08 05:10:03,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:03,886 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-02-08 05:10:03,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:10:03,887 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-02-08 05:10:03,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:03,887 INFO L85 PathProgramCache]: Analyzing trace with hash -954693585, now seen corresponding path program 1 times [2025-02-08 05:10:03,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:03,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990533120] [2025-02-08 05:10:03,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:03,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:03,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:10:03,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:10:03,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:03,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:03,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:10:03,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:10:03,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:10:03,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:03,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:03,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:10:03,940 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:10:03,940 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 40 remaining) [2025-02-08 05:10:03,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (38 of 40 remaining) [2025-02-08 05:10:03,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (37 of 40 remaining) [2025-02-08 05:10:03,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (36 of 40 remaining) [2025-02-08 05:10:03,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (35 of 40 remaining) [2025-02-08 05:10:03,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 40 remaining) [2025-02-08 05:10:03,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (33 of 40 remaining) [2025-02-08 05:10:03,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (32 of 40 remaining) [2025-02-08 05:10:03,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (31 of 40 remaining) [2025-02-08 05:10:03,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (30 of 40 remaining) [2025-02-08 05:10:03,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 40 remaining) [2025-02-08 05:10:03,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (28 of 40 remaining) [2025-02-08 05:10:03,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (27 of 40 remaining) [2025-02-08 05:10:03,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 40 remaining) [2025-02-08 05:10:03,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (25 of 40 remaining) [2025-02-08 05:10:03,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (24 of 40 remaining) [2025-02-08 05:10:03,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 40 remaining) [2025-02-08 05:10:03,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 40 remaining) [2025-02-08 05:10:03,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (21 of 40 remaining) [2025-02-08 05:10:03,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (20 of 40 remaining) [2025-02-08 05:10:03,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (19 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (18 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (12 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (11 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (10 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 40 remaining) [2025-02-08 05:10:03,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 40 remaining) [2025-02-08 05:10:03,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 40 remaining) [2025-02-08 05:10:03,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 40 remaining) [2025-02-08 05:10:03,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:10:03,943 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 05:10:03,943 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:10:03,947 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:10:03,994 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:03,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 268 transitions, 554 flow [2025-02-08 05:10:04,051 INFO L124 PetriNetUnfolderBase]: 18/293 cut-off events. [2025-02-08 05:10:04,051 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:10:04,057 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 922 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-02-08 05:10:04,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 257 places, 268 transitions, 554 flow [2025-02-08 05:10:04,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 268 transitions, 554 flow [2025-02-08 05:10:04,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:04,066 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;@4e961b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:04,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-02-08 05:10:04,089 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:04,090 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-02-08 05:10:04,090 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:10:04,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:04,091 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-02-08 05:10:04,091 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-02-08 05:10:04,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash -505059381, now seen corresponding path program 1 times [2025-02-08 05:10:04,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:04,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4400362] [2025-02-08 05:10:04,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:04,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:04,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:10:04,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:10:04,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:04,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:04,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:04,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4400362] [2025-02-08 05:10:04,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4400362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:04,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:04,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:10:04,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799153569] [2025-02-08 05:10:04,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:04,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:10:04,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:04,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:10:04,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:10:04,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 268 [2025-02-08 05:10:04,144 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-02-08 05:10:04,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:04,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 268 [2025-02-08 05:10:04,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:04,286 INFO L124 PetriNetUnfolderBase]: 32/774 cut-off events. [2025-02-08 05:10:04,286 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-08 05:10:04,293 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 4703 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-02-08 05:10:04,298 INFO L140 encePairwiseOnDemand]: 240/268 looper letters, 6 selfloop transitions, 0 changer transitions 0/231 dead transitions. [2025-02-08 05:10:04,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 231 transitions, 492 flow [2025-02-08 05:10:04,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:10:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:10:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 496 transitions. [2025-02-08 05:10:04,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9253731343283582 [2025-02-08 05:10:04,302 INFO L175 Difference]: Start difference. First operand has 257 places, 268 transitions, 554 flow. Second operand 2 states and 496 transitions. [2025-02-08 05:10:04,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 231 transitions, 492 flow [2025-02-08 05:10:04,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 231 transitions, 490 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:04,312 INFO L231 Difference]: Finished difference. Result has 233 places, 231 transitions, 478 flow [2025-02-08 05:10:04,314 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-02-08 05:10:04,315 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -24 predicate places. [2025-02-08 05:10:04,315 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 231 transitions, 478 flow [2025-02-08 05:10:04,315 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-02-08 05:10:04,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:04,316 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-02-08 05:10:04,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:10:04,318 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-02-08 05:10:04,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:04,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1705336104, now seen corresponding path program 1 times [2025-02-08 05:10:04,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:04,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920590539] [2025-02-08 05:10:04,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:04,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:04,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:10:04,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:10:04,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:04,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:04,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:04,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920590539] [2025-02-08 05:10:04,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920590539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:04,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:04,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:10:04,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790888168] [2025-02-08 05:10:04,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:04,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:04,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:04,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:04,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:04,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 268 [2025-02-08 05:10:04,490 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-02-08 05:10:04,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:04,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 268 [2025-02-08 05:10:04,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:05,579 INFO L124 PetriNetUnfolderBase]: 1088/6875 cut-off events. [2025-02-08 05:10:05,580 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-02-08 05:10:05,608 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 68926 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-02-08 05:10:05,652 INFO L140 encePairwiseOnDemand]: 244/268 looper letters, 29 selfloop transitions, 18 changer transitions 0/251 dead transitions. [2025-02-08 05:10:05,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 251 transitions, 622 flow [2025-02-08 05:10:05,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2025-02-08 05:10:05,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.849502487562189 [2025-02-08 05:10:05,657 INFO L175 Difference]: Start difference. First operand has 233 places, 231 transitions, 478 flow. Second operand 3 states and 683 transitions. [2025-02-08 05:10:05,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 251 transitions, 622 flow [2025-02-08 05:10:05,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 251 transitions, 622 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:05,665 INFO L231 Difference]: Finished difference. Result has 237 places, 249 transitions, 634 flow [2025-02-08 05:10:05,665 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-02-08 05:10:05,667 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -20 predicate places. [2025-02-08 05:10:05,668 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 249 transitions, 634 flow [2025-02-08 05:10:05,669 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-02-08 05:10:05,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:05,669 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-02-08 05:10:05,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:10:05,669 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-02-08 05:10:05,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:05,670 INFO L85 PathProgramCache]: Analyzing trace with hash -842280447, now seen corresponding path program 1 times [2025-02-08 05:10:05,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:05,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625391697] [2025-02-08 05:10:05,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:05,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:05,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:10:05,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:10:05,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:05,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:05,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:10:05,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:10:05,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:10:05,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:05,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:05,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:10:05,719 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:10:05,720 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2025-02-08 05:10:05,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2025-02-08 05:10:05,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2025-02-08 05:10:05,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2025-02-08 05:10:05,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2025-02-08 05:10:05,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2025-02-08 05:10:05,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2025-02-08 05:10:05,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2025-02-08 05:10:05,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2025-02-08 05:10:05,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2025-02-08 05:10:05,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2025-02-08 05:10:05,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2025-02-08 05:10:05,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2025-02-08 05:10:05,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2025-02-08 05:10:05,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2025-02-08 05:10:05,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2025-02-08 05:10:05,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2025-02-08 05:10:05,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2025-02-08 05:10:05,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2025-02-08 05:10:05,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2025-02-08 05:10:05,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2025-02-08 05:10:05,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2025-02-08 05:10:05,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2025-02-08 05:10:05,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2025-02-08 05:10:05,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2025-02-08 05:10:05,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2025-02-08 05:10:05,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2025-02-08 05:10:05,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2025-02-08 05:10:05,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2025-02-08 05:10:05,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2025-02-08 05:10:05,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2025-02-08 05:10:05,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2025-02-08 05:10:05,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2025-02-08 05:10:05,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2025-02-08 05:10:05,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2025-02-08 05:10:05,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2025-02-08 05:10:05,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2025-02-08 05:10:05,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2025-02-08 05:10:05,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2025-02-08 05:10:05,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2025-02-08 05:10:05,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2025-02-08 05:10:05,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2025-02-08 05:10:05,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2025-02-08 05:10:05,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2025-02-08 05:10:05,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2025-02-08 05:10:05,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2025-02-08 05:10:05,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2025-02-08 05:10:05,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2025-02-08 05:10:05,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2025-02-08 05:10:05,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2025-02-08 05:10:05,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2025-02-08 05:10:05,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2025-02-08 05:10:05,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2025-02-08 05:10:05,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:10:05,725 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:10:05,726 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:10:05,726 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:10:05,774 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:05,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 335 places, 350 transitions, 728 flow [2025-02-08 05:10:05,823 INFO L124 PetriNetUnfolderBase]: 24/384 cut-off events. [2025-02-08 05:10:05,823 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:10:05,828 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 1437 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-02-08 05:10:05,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 335 places, 350 transitions, 728 flow [2025-02-08 05:10:05,834 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 335 places, 350 transitions, 728 flow [2025-02-08 05:10:05,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:05,836 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;@4e961b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:05,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2025-02-08 05:10:05,839 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:05,841 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-02-08 05:10:05,841 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:10:05,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:05,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:10:05,841 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-02-08 05:10:05,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash -461406468, now seen corresponding path program 1 times [2025-02-08 05:10:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:05,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407209195] [2025-02-08 05:10:05,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:05,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:05,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:10:05,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:10:05,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:05,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:05,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:05,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407209195] [2025-02-08 05:10:05,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407209195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:05,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:05,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:10:05,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12202209] [2025-02-08 05:10:05,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:05,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:10:05,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:05,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:10:05,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:10:05,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 350 [2025-02-08 05:10:05,864 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-02-08 05:10:05,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:05,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 350 [2025-02-08 05:10:05,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:06,144 INFO L124 PetriNetUnfolderBase]: 86/1784 cut-off events. [2025-02-08 05:10:06,144 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-02-08 05:10:06,170 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 14812 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-02-08 05:10:06,184 INFO L140 encePairwiseOnDemand]: 313/350 looper letters, 8 selfloop transitions, 0 changer transitions 0/302 dead transitions. [2025-02-08 05:10:06,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 302 transitions, 648 flow [2025-02-08 05:10:06,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:10:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:10:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 647 transitions. [2025-02-08 05:10:06,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9242857142857143 [2025-02-08 05:10:06,188 INFO L175 Difference]: Start difference. First operand has 335 places, 350 transitions, 728 flow. Second operand 2 states and 647 transitions. [2025-02-08 05:10:06,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 302 transitions, 648 flow [2025-02-08 05:10:06,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 302 transitions, 642 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:06,195 INFO L231 Difference]: Finished difference. Result has 304 places, 302 transitions, 626 flow [2025-02-08 05:10:06,195 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-02-08 05:10:06,197 INFO L279 CegarLoopForPetriNet]: 335 programPoint places, -31 predicate places. [2025-02-08 05:10:06,197 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 302 transitions, 626 flow [2025-02-08 05:10:06,197 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-02-08 05:10:06,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:06,198 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-02-08 05:10:06,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:10:06,198 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-02-08 05:10:06,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:06,199 INFO L85 PathProgramCache]: Analyzing trace with hash -709099383, now seen corresponding path program 1 times [2025-02-08 05:10:06,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:06,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367122187] [2025-02-08 05:10:06,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:06,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:06,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:10:06,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:10:06,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:06,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:06,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:06,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367122187] [2025-02-08 05:10:06,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367122187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:06,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:06,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:10:06,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516320305] [2025-02-08 05:10:06,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:06,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:06,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:06,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:06,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:06,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 350 [2025-02-08 05:10:06,318 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-02-08 05:10:06,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:06,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 350 [2025-02-08 05:10:06,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:13,631 INFO L124 PetriNetUnfolderBase]: 15440/65818 cut-off events. [2025-02-08 05:10:13,632 INFO L125 PetriNetUnfolderBase]: For 2056/2056 co-relation queries the response was YES. [2025-02-08 05:10:13,949 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 923681 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-02-08 05:10:14,373 INFO L140 encePairwiseOnDemand]: 318/350 looper letters, 39 selfloop transitions, 24 changer transitions 0/329 dead transitions. [2025-02-08 05:10:14,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 329 transitions, 821 flow [2025-02-08 05:10:14,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 890 transitions. [2025-02-08 05:10:14,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8476190476190476 [2025-02-08 05:10:14,377 INFO L175 Difference]: Start difference. First operand has 304 places, 302 transitions, 626 flow. Second operand 3 states and 890 transitions. [2025-02-08 05:10:14,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 329 transitions, 821 flow [2025-02-08 05:10:14,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 329 transitions, 821 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:14,389 INFO L231 Difference]: Finished difference. Result has 308 places, 326 transitions, 834 flow [2025-02-08 05:10:14,389 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-02-08 05:10:14,391 INFO L279 CegarLoopForPetriNet]: 335 programPoint places, -27 predicate places. [2025-02-08 05:10:14,391 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 326 transitions, 834 flow [2025-02-08 05:10:14,392 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-02-08 05:10:14,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:14,392 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-02-08 05:10:14,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:10:14,392 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-02-08 05:10:14,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:14,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1585394614, now seen corresponding path program 1 times [2025-02-08 05:10:14,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:14,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329198810] [2025-02-08 05:10:14,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:14,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:14,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:10:14,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:10:14,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:14,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:14,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:14,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:14,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329198810] [2025-02-08 05:10:14,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329198810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:14,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:14,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:10:14,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783800366] [2025-02-08 05:10:14,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:14,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:14,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:14,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:14,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:14,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 350 [2025-02-08 05:10:14,544 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-02-08 05:10:14,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:14,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 350 [2025-02-08 05:10:14,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:17,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1066] L693-->L704: Formula: (and (let ((.cse1 (mod (mod (+ v_~next_ticket~0_56 1) 4294967296) 3))) (let ((.cse0 (= (mod v_~now_serving~0_22 4294967296) .cse1))) (or (and (not .cse0) (= v_~next_ticket~0_56 |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) (= v_~next_ticket~0_55 .cse1)) (and (= |v_#race~next_ticket~0_91| 0) (= v_~next_ticket~0_56 v_~next_ticket~0_55) (= |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|) .cse0)))) (= |v_#race~now_serving~0_27| 0)) InVars {~now_serving~0=v_~now_serving~0_22, ~next_ticket~0=v_~next_ticket~0_56, 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_22, #race~now_serving~0=|v_#race~now_serving~0_27|, ~next_ticket~0=v_~next_ticket~0_55, 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_91|, 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][143], [338#true, 336#true, 14#L704true, 52#L734-2true, 347#(= |#race~c~0| 0), 334#true, 332#true, 236#L713-1true, Black: 340#true, 45#L713true, 176#L728-6true, 330#true, 342#(= |#race~now_serving~0| 0)]) [2025-02-08 05:10:17,946 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-02-08 05:10:17,946 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-02-08 05:10:17,946 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-02-08 05:10:17,946 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-02-08 05:10:18,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1147] L693-->L704: Formula: (and (= |v_#race~now_serving~0_27| 0) (let ((.cse1 (mod (mod (+ v_~next_ticket~0_56 1) 4294967296) 3))) (let ((.cse0 (= (mod v_~now_serving~0_22 4294967296) .cse1))) (or (and (= 3 |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) (= |v_#race~next_ticket~0_91| 0) (= v_~next_ticket~0_56 v_~next_ticket~0_55) (= |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6| |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|) .cse0) (and (not .cse0) (= v_~next_ticket~0_55 .cse1) (= v_~next_ticket~0_56 |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|)))))) InVars {~now_serving~0=v_~now_serving~0_22, 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_56} OutVars{~now_serving~0=v_~now_serving~0_22, 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_27|, ~next_ticket~0=v_~next_ticket~0_55, 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_91|} 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, 52#L734-2true, 214#L713true, 347#(= |#race~c~0| 0), 334#true, 332#true, 236#L713-1true, 39#L704true, Black: 340#true, 176#L728-6true, 330#true, 342#(= |#race~now_serving~0| 0)]) [2025-02-08 05:10:18,337 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-02-08 05:10:18,337 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-02-08 05:10:18,337 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-02-08 05:10:18,337 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-02-08 05:10:18,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1228] L693-->L704: Formula: (and (let ((.cse1 (mod (mod (+ v_~next_ticket~0_56 1) 4294967296) 3))) (let ((.cse0 (= (mod v_~now_serving~0_22 4294967296) .cse1))) (or (and (not .cse0) (= v_~next_ticket~0_55 .cse1) (= v_~next_ticket~0_56 |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|)) (and (= |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6| |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|) (= |v_#race~next_ticket~0_91| 0) (= v_~next_ticket~0_56 v_~next_ticket~0_55) (= 3 |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) .cse0)))) (= |v_#race~now_serving~0_27| 0)) InVars {~now_serving~0=v_~now_serving~0_22, ~next_ticket~0=v_~next_ticket~0_56, 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_22, #race~now_serving~0=|v_#race~now_serving~0_27|, 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_55, #race~next_ticket~0=|v_#race~next_ticket~0_91|, 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, 312#L713-1true, 91#L704true, 52#L734-2true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 11#L728-6true, 45#L713true, 330#true, 342#(= |#race~now_serving~0| 0)]) [2025-02-08 05:10:18,454 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-02-08 05:10:18,454 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-02-08 05:10:18,454 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-02-08 05:10:18,454 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-02-08 05:10:18,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1147] L693-->L704: Formula: (and (= |v_#race~now_serving~0_27| 0) (let ((.cse1 (mod (mod (+ v_~next_ticket~0_56 1) 4294967296) 3))) (let ((.cse0 (= (mod v_~now_serving~0_22 4294967296) .cse1))) (or (and (= 3 |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) (= |v_#race~next_ticket~0_91| 0) (= v_~next_ticket~0_56 v_~next_ticket~0_55) (= |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6| |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|) .cse0) (and (not .cse0) (= v_~next_ticket~0_55 .cse1) (= v_~next_ticket~0_56 |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|)))))) InVars {~now_serving~0=v_~now_serving~0_22, 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_56} OutVars{~now_serving~0=v_~now_serving~0_22, 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_27|, ~next_ticket~0=v_~next_ticket~0_55, 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_91|} 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, 8#L728-7true, 52#L734-2true, 214#L713true, 334#true, 347#(= |#race~c~0| 0), 332#true, 236#L713-1true, 39#L704true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0)]) [2025-02-08 05:10:18,553 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-02-08 05:10:18,553 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-02-08 05:10:18,553 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-02-08 05:10:18,553 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-02-08 05:10:18,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1066] L693-->L704: Formula: (and (let ((.cse1 (mod (mod (+ v_~next_ticket~0_56 1) 4294967296) 3))) (let ((.cse0 (= (mod v_~now_serving~0_22 4294967296) .cse1))) (or (and (not .cse0) (= v_~next_ticket~0_56 |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) (= v_~next_ticket~0_55 .cse1)) (and (= |v_#race~next_ticket~0_91| 0) (= v_~next_ticket~0_56 v_~next_ticket~0_55) (= |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|) .cse0)))) (= |v_#race~now_serving~0_27| 0)) InVars {~now_serving~0=v_~now_serving~0_22, ~next_ticket~0=v_~next_ticket~0_56, 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_22, #race~now_serving~0=|v_#race~now_serving~0_27|, ~next_ticket~0=v_~next_ticket~0_55, 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_91|, 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][143], [338#true, 336#true, 8#L728-7true, 14#L704true, 52#L734-2true, 347#(= |#race~c~0| 0), 334#true, 332#true, 236#L713-1true, Black: 340#true, 45#L713true, 330#true, 342#(= |#race~now_serving~0| 0)]) [2025-02-08 05:10:18,564 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-02-08 05:10:18,564 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-02-08 05:10:18,564 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-02-08 05:10:18,564 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-02-08 05:10:18,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1228] L693-->L704: Formula: (and (let ((.cse1 (mod (mod (+ v_~next_ticket~0_56 1) 4294967296) 3))) (let ((.cse0 (= (mod v_~now_serving~0_22 4294967296) .cse1))) (or (and (not .cse0) (= v_~next_ticket~0_55 .cse1) (= v_~next_ticket~0_56 |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|)) (and (= |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6| |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|) (= |v_#race~next_ticket~0_91| 0) (= v_~next_ticket~0_56 v_~next_ticket~0_55) (= 3 |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) .cse0)))) (= |v_#race~now_serving~0_27| 0)) InVars {~now_serving~0=v_~now_serving~0_22, ~next_ticket~0=v_~next_ticket~0_56, 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_22, #race~now_serving~0=|v_#race~now_serving~0_27|, 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_55, #race~next_ticket~0=|v_#race~next_ticket~0_91|, 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, 312#L713-1true, 91#L704true, 52#L734-2true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 45#L713true, 327#L728-7true, 330#true, 342#(= |#race~now_serving~0| 0)]) [2025-02-08 05:10:18,708 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-02-08 05:10:18,708 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-02-08 05:10:18,708 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-02-08 05:10:18,709 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-02-08 05:10:19,053 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] 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, 91#L704true, 66#L727-2true, 52#L734-2true, 214#L713true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 261#L726-6true]) [2025-02-08 05:10:19,053 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2025-02-08 05:10:19,053 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-02-08 05:10:19,053 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-02-08 05:10:19,053 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-02-08 05:10:19,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1084] 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, 42#L713-1true, 336#true, 170#L704true, 52#L734-2true, 334#true, 347#(= |#race~c~0| 0), 195#L726-6true, 332#true, Black: 340#true, 176#L728-6true, 330#true, 342#(= |#race~now_serving~0| 0)]) [2025-02-08 05:10:19,272 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2025-02-08 05:10:19,272 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-02-08 05:10:19,272 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-02-08 05:10:19,272 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-02-08 05:10:19,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1084] 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, 42#L713-1true, 8#L728-7true, 170#L704true, 52#L734-2true, 347#(= |#race~c~0| 0), 334#true, 195#L726-6true, 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0)]) [2025-02-08 05:10:19,552 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-02-08 05:10:19,552 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-02-08 05:10:19,552 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-02-08 05:10:19,553 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-02-08 05:10:19,608 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] 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, 91#L704true, 52#L734-2true, 214#L713true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 11#L728-6true, 330#true, 342#(= |#race~now_serving~0| 0), 261#L726-6true]) [2025-02-08 05:10:19,608 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-02-08 05:10:19,608 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-02-08 05:10:19,608 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-02-08 05:10:19,608 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-02-08 05:10:20,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] 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, 8#L728-7true, 170#L704true, 52#L734-2true, 214#L713true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 261#L726-6true]) [2025-02-08 05:10:20,085 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-02-08 05:10:20,085 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-02-08 05:10:20,085 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-02-08 05:10:20,085 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-02-08 05:10:20,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] 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, 91#L704true, 52#L734-2true, 214#L713true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 330#true, 327#L728-7true, 342#(= |#race~now_serving~0| 0), 261#L726-6true]) [2025-02-08 05:10:20,164 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-02-08 05:10:20,164 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-02-08 05:10:20,164 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-02-08 05:10:20,164 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-02-08 05:10:25,548 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1084] 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, 42#L713-1true, 107#L726-6true, 52#L734-2true, 334#true, 347#(= |#race~c~0| 0), 195#L726-6true, 332#true, Black: 340#true, 176#L728-6true, 330#true, 342#(= |#race~now_serving~0| 0)]) [2025-02-08 05:10:25,548 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-02-08 05:10:25,548 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-02-08 05:10:25,548 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-02-08 05:10:25,548 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-02-08 05:10:26,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1084] 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, 42#L713-1true, 246#L726-7true, 52#L734-2true, 334#true, 347#(= |#race~c~0| 0), 195#L726-6true, 332#true, Black: 340#true, 176#L728-6true, 330#true, 342#(= |#race~now_serving~0| 0)]) [2025-02-08 05:10:26,378 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-02-08 05:10:26,378 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-02-08 05:10:26,378 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-02-08 05:10:26,378 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-02-08 05:10:26,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1084] 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, 8#L728-7true, 336#true, 42#L713-1true, 107#L726-6true, 52#L734-2true, 347#(= |#race~c~0| 0), 334#true, 195#L726-6true, 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0)]) [2025-02-08 05:10:26,392 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-02-08 05:10:26,392 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-02-08 05:10:26,392 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-02-08 05:10:26,392 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-02-08 05:10:27,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1084] 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, 42#L713-1true, 8#L728-7true, 246#L726-7true, 52#L734-2true, 334#true, 347#(= |#race~c~0| 0), 195#L726-6true, 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0)]) [2025-02-08 05:10:27,298 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2025-02-08 05:10:27,298 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-02-08 05:10:27,299 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-02-08 05:10:27,299 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-02-08 05:10:27,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] 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, 8#L728-7true, 336#true, 107#L726-6true, 52#L734-2true, 214#L713true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 261#L726-6true]) [2025-02-08 05:10:27,319 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2025-02-08 05:10:27,319 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-02-08 05:10:27,319 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-02-08 05:10:27,319 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-02-08 05:10:28,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] 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, 8#L728-7true, 246#L726-7true, 52#L734-2true, 214#L713true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 261#L726-6true]) [2025-02-08 05:10:28,488 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-02-08 05:10:28,488 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-02-08 05:10:28,488 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-02-08 05:10:28,488 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-02-08 05:10:28,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] 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], [75#L726-6true, 338#true, 336#true, 312#L713-1true, 52#L734-2true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 330#true, 327#L728-7true, 261#L726-6true, 342#(= |#race~now_serving~0| 0)]) [2025-02-08 05:10:28,656 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2025-02-08 05:10:28,656 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-02-08 05:10:28,656 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-02-08 05:10:28,656 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-02-08 05:10:29,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] 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], [75#L726-6true, 338#true, 336#true, 52#L734-2true, 214#L713true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 327#L728-7true, 330#true, 342#(= |#race~now_serving~0| 0), 261#L726-6true]) [2025-02-08 05:10:29,032 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-02-08 05:10:29,032 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-02-08 05:10:29,032 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-02-08 05:10:29,032 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-02-08 05:10:29,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] 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, 312#L713-1true, 52#L734-2true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 330#true, 327#L728-7true, 342#(= |#race~now_serving~0| 0), 258#L726-7true, 261#L726-6true]) [2025-02-08 05:10:29,594 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-02-08 05:10:29,594 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-02-08 05:10:29,594 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-02-08 05:10:29,594 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-02-08 05:10:30,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] 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, 52#L734-2true, 214#L713true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 327#L728-7true, 330#true, 342#(= |#race~now_serving~0| 0), 258#L726-7true, 261#L726-6true]) [2025-02-08 05:10:30,093 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2025-02-08 05:10:30,093 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-02-08 05:10:30,093 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-02-08 05:10:30,093 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-02-08 05:10:41,566 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] 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, 91#L704true, 66#L727-2true, 52#L734-2true, 334#true, 347#(= |#race~c~0| 0), 291#L721-6true, 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 261#L726-6true]) [2025-02-08 05:10:41,567 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2025-02-08 05:10:41,567 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:10:41,567 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-02-08 05:10:41,567 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-02-08 05:10:42,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] 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, 170#L704true, 52#L734-2true, 334#true, 347#(= |#race~c~0| 0), 291#L721-6true, 332#true, Black: 340#true, 176#L728-6true, 330#true, 342#(= |#race~now_serving~0| 0), 261#L726-6true]) [2025-02-08 05:10:42,999 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-02-08 05:10:42,999 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-08 05:10:42,999 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-08 05:10:42,999 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-08 05:10:43,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] 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, 91#L704true, 52#L734-2true, 347#(= |#race~c~0| 0), 334#true, 291#L721-6true, 332#true, Black: 340#true, 11#L728-6true, 330#true, 261#L726-6true, 342#(= |#race~now_serving~0| 0)]) [2025-02-08 05:10:43,209 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-02-08 05:10:43,209 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-08 05:10:43,209 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-02-08 05:10:43,209 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-08 05:10:46,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] 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, 8#L728-7true, 170#L704true, 52#L734-2true, 334#true, 347#(= |#race~c~0| 0), 291#L721-6true, 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 261#L726-6true]) [2025-02-08 05:10:46,023 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2025-02-08 05:10:46,023 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:10:46,023 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:10:46,023 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:10:46,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] 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, 91#L704true, 52#L734-2true, 347#(= |#race~c~0| 0), 334#true, 291#L721-6true, 332#true, Black: 340#true, 327#L728-7true, 330#true, 261#L726-6true, 342#(= |#race~now_serving~0| 0)]) [2025-02-08 05:10:46,161 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2025-02-08 05:10:46,161 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:10:46,161 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:10:46,161 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event