./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/14_spin2003.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/14_spin2003.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83bca07672f78100877a79a1440d2a8107bad3ebb200d176bee629abfa2ef706 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:59:09,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:59:09,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:59:09,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:59:09,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:59:09,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:59:09,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:59:09,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:59:09,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:59:09,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:59:09,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:59:09,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:59:09,279 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:59:09,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:59:09,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:59:09,279 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:59:09,279 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:59:09,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:59:09,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:59:09,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:59:09,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:59:09,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:59:09,280 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:59:09,280 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:59:09,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:59:09,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:59:09,281 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83bca07672f78100877a79a1440d2a8107bad3ebb200d176bee629abfa2ef706 [2025-03-13 21:59:09,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:59:09,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:59:09,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:59:09,530 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:59:09,530 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:59:09,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/14_spin2003.i [2025-03-13 21:59:10,650 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/722a4976e/315cf1f7c85a46e3ba7e955cc2bc80e0/FLAGfb6379465 [2025-03-13 21:59:10,967 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:59:10,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/14_spin2003.i [2025-03-13 21:59:10,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/722a4976e/315cf1f7c85a46e3ba7e955cc2bc80e0/FLAGfb6379465 [2025-03-13 21:59:11,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/722a4976e/315cf1f7c85a46e3ba7e955cc2bc80e0 [2025-03-13 21:59:11,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:59:11,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:59:11,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:59:11,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:59:11,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:59:11,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:59:11" (1/1) ... [2025-03-13 21:59:11,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39582f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:11, skipping insertion in model container [2025-03-13 21:59:11,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:59:11" (1/1) ... [2025-03-13 21:59:11,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:59:11,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:59:11,495 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:59:11,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:59:11,566 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:59:11,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:11 WrapperNode [2025-03-13 21:59:11,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:59:11,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:59:11,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:59:11,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:59:11,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:11" (1/1) ... [2025-03-13 21:59:11,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:11" (1/1) ... [2025-03-13 21:59:11,592 INFO L138 Inliner]: procedures = 161, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-03-13 21:59:11,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:59:11,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:59:11,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:59:11,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:59:11,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:11" (1/1) ... [2025-03-13 21:59:11,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:11" (1/1) ... [2025-03-13 21:59:11,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:11" (1/1) ... [2025-03-13 21:59:11,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:11" (1/1) ... [2025-03-13 21:59:11,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:11" (1/1) ... [2025-03-13 21:59:11,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:11" (1/1) ... [2025-03-13 21:59:11,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:11" (1/1) ... [2025-03-13 21:59:11,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:11" (1/1) ... [2025-03-13 21:59:11,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:59:11,603 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:59:11,604 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:59:11,604 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:59:11,604 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:11" (1/1) ... [2025-03-13 21:59:11,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:59:11,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:11,630 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:59:11,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:59:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 21:59:11,647 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 21:59:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:59:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:59:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:59:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:59:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:59:11,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:59:11,648 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:59:11,742 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:59:11,744 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:59:11,843 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:59:11,844 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:59:11,844 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:59:11,862 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:59:11,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:59:11 BoogieIcfgContainer [2025-03-13 21:59:11,863 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:59:11,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:59:11,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:59:11,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:59:11,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:59:11" (1/3) ... [2025-03-13 21:59:11,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a76efb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:59:11, skipping insertion in model container [2025-03-13 21:59:11,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:11" (2/3) ... [2025-03-13 21:59:11,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a76efb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:59:11, skipping insertion in model container [2025-03-13 21:59:11,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:59:11" (3/3) ... [2025-03-13 21:59:11,871 INFO L128 eAbstractionObserver]: Analyzing ICFG 14_spin2003.i [2025-03-13 21:59:11,882 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:59:11,885 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 14_spin2003.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 3 error locations. [2025-03-13 21:59:11,885 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:59:11,929 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:11,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 56 transitions, 116 flow [2025-03-13 21:59:11,983 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2025-03-13 21:59:11,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:59:11,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-13 21:59:11,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 56 transitions, 116 flow [2025-03-13 21:59:11,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 56 transitions, 116 flow [2025-03-13 21:59:11,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:12,005 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;@224c39e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:12,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-13 21:59:12,013 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:12,013 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-13 21:59:12,013 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:59:12,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:12,013 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:12,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:59:12,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:12,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1409739880, now seen corresponding path program 1 times [2025-03-13 21:59:12,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:12,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842717662] [2025-03-13 21:59:12,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:12,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:12,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:59:12,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:59:12,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:12,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:12,123 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:12,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:59:12,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:59:12,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:12,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:12,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:12,163 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:12,165 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-13 21:59:12,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-13 21:59:12,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-13 21:59:12,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-13 21:59:12,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-13 21:59:12,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-13 21:59:12,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-13 21:59:12,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:59:12,168 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-13 21:59:12,172 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:12,172 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:59:12,204 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:12,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 184 flow [2025-03-13 21:59:12,241 INFO L124 PetriNetUnfolderBase]: 4/101 cut-off events. [2025-03-13 21:59:12,241 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:59:12,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 101 events. 4/101 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 177 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 67. Up to 3 conditions per place. [2025-03-13 21:59:12,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 184 flow [2025-03-13 21:59:12,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 87 transitions, 184 flow [2025-03-13 21:59:12,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:12,247 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;@224c39e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:12,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-13 21:59:12,260 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:12,262 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2025-03-13 21:59:12,262 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:59:12,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:12,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:12,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-13 21:59:12,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:12,264 INFO L85 PathProgramCache]: Analyzing trace with hash 819541548, now seen corresponding path program 1 times [2025-03-13 21:59:12,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:12,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658478052] [2025-03-13 21:59:12,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:12,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:59:12,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:59:12,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:12,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:12,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:12,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658478052] [2025-03-13 21:59:12,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658478052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:12,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:12,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:59:12,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267678406] [2025-03-13 21:59:12,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:12,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:12,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:12,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:12,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:12,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 87 [2025-03-13 21:59:12,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:12,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:12,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 87 [2025-03-13 21:59:12,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:12,546 INFO L124 PetriNetUnfolderBase]: 57/327 cut-off events. [2025-03-13 21:59:12,548 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-13 21:59:12,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 327 events. 57/327 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1636 event pairs, 37 based on Foata normal form. 110/392 useless extension candidates. Maximal degree in co-relation 383. Up to 109 conditions per place. [2025-03-13 21:59:12,552 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 18 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2025-03-13 21:59:12,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 229 flow [2025-03-13 21:59:12,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2025-03-13 21:59:12,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8620689655172413 [2025-03-13 21:59:12,564 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 184 flow. Second operand 3 states and 225 transitions. [2025-03-13 21:59:12,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 229 flow [2025-03-13 21:59:12,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 229 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:12,571 INFO L231 Difference]: Finished difference. Result has 84 places, 80 transitions, 206 flow [2025-03-13 21:59:12,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=84, PETRI_TRANSITIONS=80} [2025-03-13 21:59:12,576 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -4 predicate places. [2025-03-13 21:59:12,576 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 206 flow [2025-03-13 21:59:12,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:12,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:12,577 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:12,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:59:12,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-13 21:59:12,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:12,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1726731595, now seen corresponding path program 1 times [2025-03-13 21:59:12,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:12,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626293287] [2025-03-13 21:59:12,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:12,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:12,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:59:12,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:59:12,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:12,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:12,598 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:12,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:59:12,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:59:12,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:12,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:12,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:12,611 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:12,611 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-13 21:59:12,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-13 21:59:12,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-13 21:59:12,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-13 21:59:12,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-13 21:59:12,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-13 21:59:12,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-13 21:59:12,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-13 21:59:12,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-13 21:59:12,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-13 21:59:12,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:59:12,614 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 21:59:12,614 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:12,614 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 21:59:12,643 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:12,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 118 transitions, 254 flow [2025-03-13 21:59:12,666 INFO L124 PetriNetUnfolderBase]: 6/139 cut-off events. [2025-03-13 21:59:12,667 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:59:12,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 6/139 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 353 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 105. Up to 4 conditions per place. [2025-03-13 21:59:12,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 118 transitions, 254 flow [2025-03-13 21:59:12,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 118 transitions, 254 flow [2025-03-13 21:59:12,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:12,670 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;@224c39e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:12,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-13 21:59:12,674 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:12,674 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2025-03-13 21:59:12,674 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:59:12,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:12,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:12,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2025-03-13 21:59:12,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:12,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1149847858, now seen corresponding path program 1 times [2025-03-13 21:59:12,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:12,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820720401] [2025-03-13 21:59:12,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:12,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:12,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:59:12,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:59:12,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:12,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:12,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:12,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:12,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820720401] [2025-03-13 21:59:12,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820720401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:12,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:12,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:59:12,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337114659] [2025-03-13 21:59:12,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:12,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:12,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:12,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:12,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:12,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 118 [2025-03-13 21:59:12,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:12,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:12,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 118 [2025-03-13 21:59:12,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:13,055 INFO L124 PetriNetUnfolderBase]: 783/2639 cut-off events. [2025-03-13 21:59:13,055 INFO L125 PetriNetUnfolderBase]: For 427/427 co-relation queries the response was YES. [2025-03-13 21:59:13,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4215 conditions, 2639 events. 783/2639 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 22867 event pairs, 558 based on Foata normal form. 842/3085 useless extension candidates. Maximal degree in co-relation 3328. Up to 1091 conditions per place. [2025-03-13 21:59:13,068 INFO L140 encePairwiseOnDemand]: 101/118 looper letters, 27 selfloop transitions, 9 changer transitions 0/116 dead transitions. [2025-03-13 21:59:13,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 116 transitions, 334 flow [2025-03-13 21:59:13,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2025-03-13 21:59:13,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.867231638418079 [2025-03-13 21:59:13,070 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 254 flow. Second operand 3 states and 307 transitions. [2025-03-13 21:59:13,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 116 transitions, 334 flow [2025-03-13 21:59:13,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 330 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:13,073 INFO L231 Difference]: Finished difference. Result has 113 places, 110 transitions, 290 flow [2025-03-13 21:59:13,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=113, PETRI_TRANSITIONS=110} [2025-03-13 21:59:13,073 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -6 predicate places. [2025-03-13 21:59:13,074 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 110 transitions, 290 flow [2025-03-13 21:59:13,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:13,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:13,074 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:13,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:59:13,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2025-03-13 21:59:13,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:13,075 INFO L85 PathProgramCache]: Analyzing trace with hash -741546492, now seen corresponding path program 1 times [2025-03-13 21:59:13,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:13,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508290158] [2025-03-13 21:59:13,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:13,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:13,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-13 21:59:13,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 21:59:13,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:13,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:13,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:13,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508290158] [2025-03-13 21:59:13,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508290158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:13,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:13,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:59:13,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214141289] [2025-03-13 21:59:13,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:13,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:13,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:13,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:13,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:13,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 118 [2025-03-13 21:59:13,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 110 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:13,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:13,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 118 [2025-03-13 21:59:13,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:13,478 INFO L124 PetriNetUnfolderBase]: 1172/3570 cut-off events. [2025-03-13 21:59:13,478 INFO L125 PetriNetUnfolderBase]: For 1101/1137 co-relation queries the response was YES. [2025-03-13 21:59:13,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6840 conditions, 3570 events. 1172/3570 cut-off events. For 1101/1137 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 32021 event pairs, 677 based on Foata normal form. 0/3060 useless extension candidates. Maximal degree in co-relation 6741. Up to 1502 conditions per place. [2025-03-13 21:59:13,508 INFO L140 encePairwiseOnDemand]: 108/118 looper letters, 31 selfloop transitions, 13 changer transitions 0/126 dead transitions. [2025-03-13 21:59:13,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 126 transitions, 437 flow [2025-03-13 21:59:13,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:13,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2025-03-13 21:59:13,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8305084745762712 [2025-03-13 21:59:13,511 INFO L175 Difference]: Start difference. First operand has 113 places, 110 transitions, 290 flow. Second operand 3 states and 294 transitions. [2025-03-13 21:59:13,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 126 transitions, 437 flow [2025-03-13 21:59:13,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 126 transitions, 411 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:59:13,520 INFO L231 Difference]: Finished difference. Result has 115 places, 121 transitions, 384 flow [2025-03-13 21:59:13,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=115, PETRI_TRANSITIONS=121} [2025-03-13 21:59:13,521 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -4 predicate places. [2025-03-13 21:59:13,521 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 121 transitions, 384 flow [2025-03-13 21:59:13,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:13,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:13,521 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:13,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:59:13,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2025-03-13 21:59:13,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:13,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1039736786, now seen corresponding path program 1 times [2025-03-13 21:59:13,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:13,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598923178] [2025-03-13 21:59:13,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:13,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:59:13,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:59:13,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:13,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:13,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:13,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:59:13,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:59:13,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:13,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:13,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:13,548 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:13,548 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-13 21:59:13,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-13 21:59:13,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-13 21:59:13,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-13 21:59:13,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-13 21:59:13,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-13 21:59:13,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-13 21:59:13,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-13 21:59:13,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-13 21:59:13,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-13 21:59:13,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-13 21:59:13,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-13 21:59:13,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-13 21:59:13,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:59:13,549 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-13 21:59:13,549 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:13,549 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 21:59:13,571 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:13,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 149 transitions, 326 flow [2025-03-13 21:59:13,592 INFO L124 PetriNetUnfolderBase]: 8/177 cut-off events. [2025-03-13 21:59:13,592 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:59:13,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 177 events. 8/177 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 536 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 147. Up to 5 conditions per place. [2025-03-13 21:59:13,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 149 transitions, 326 flow [2025-03-13 21:59:13,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 149 transitions, 326 flow [2025-03-13 21:59:13,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:13,597 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;@224c39e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:13,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-13 21:59:13,601 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:13,601 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2025-03-13 21:59:13,601 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:59:13,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:13,601 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:13,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-13 21:59:13,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:13,601 INFO L85 PathProgramCache]: Analyzing trace with hash -87559538, now seen corresponding path program 1 times [2025-03-13 21:59:13,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:13,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763781985] [2025-03-13 21:59:13,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:13,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:13,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:59:13,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:59:13,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:13,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:13,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:13,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763781985] [2025-03-13 21:59:13,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763781985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:13,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:13,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:59:13,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464038501] [2025-03-13 21:59:13,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:13,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:13,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:13,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:13,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:13,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 149 [2025-03-13 21:59:13,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 149 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:13,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:13,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 149 [2025-03-13 21:59:13,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:15,310 INFO L124 PetriNetUnfolderBase]: 7395/19445 cut-off events. [2025-03-13 21:59:15,311 INFO L125 PetriNetUnfolderBase]: For 4630/4630 co-relation queries the response was YES. [2025-03-13 21:59:15,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32302 conditions, 19445 events. 7395/19445 cut-off events. For 4630/4630 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 214877 event pairs, 5493 based on Foata normal form. 6058/22743 useless extension candidates. Maximal degree in co-relation 25149. Up to 9127 conditions per place. [2025-03-13 21:59:15,489 INFO L140 encePairwiseOnDemand]: 127/149 looper letters, 36 selfloop transitions, 12 changer transitions 0/149 dead transitions. [2025-03-13 21:59:15,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 149 transitions, 443 flow [2025-03-13 21:59:15,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2025-03-13 21:59:15,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8702460850111857 [2025-03-13 21:59:15,492 INFO L175 Difference]: Start difference. First operand has 150 places, 149 transitions, 326 flow. Second operand 3 states and 389 transitions. [2025-03-13 21:59:15,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 149 transitions, 443 flow [2025-03-13 21:59:15,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 149 transitions, 431 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:15,497 INFO L231 Difference]: Finished difference. Result has 142 places, 140 transitions, 374 flow [2025-03-13 21:59:15,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=142, PETRI_TRANSITIONS=140} [2025-03-13 21:59:15,499 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -8 predicate places. [2025-03-13 21:59:15,499 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 140 transitions, 374 flow [2025-03-13 21:59:15,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:15,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:15,499 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:15,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:59:15,500 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-13 21:59:15,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:15,500 INFO L85 PathProgramCache]: Analyzing trace with hash -645849050, now seen corresponding path program 1 times [2025-03-13 21:59:15,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:15,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071635116] [2025-03-13 21:59:15,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:15,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:15,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-13 21:59:15,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 21:59:15,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:15,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:15,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:15,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071635116] [2025-03-13 21:59:15,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071635116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:15,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:15,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:59:15,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946952032] [2025-03-13 21:59:15,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:15,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:15,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:15,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:15,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:15,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 149 [2025-03-13 21:59:15,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 140 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:15,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:15,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 149 [2025-03-13 21:59:15,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:17,473 INFO L124 PetriNetUnfolderBase]: 11941/28835 cut-off events. [2025-03-13 21:59:17,474 INFO L125 PetriNetUnfolderBase]: For 9739/10596 co-relation queries the response was YES. [2025-03-13 21:59:17,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57848 conditions, 28835 events. 11941/28835 cut-off events. For 9739/10596 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 322958 event pairs, 7371 based on Foata normal form. 15/24818 useless extension candidates. Maximal degree in co-relation 57748. Up to 13802 conditions per place. [2025-03-13 21:59:17,743 INFO L140 encePairwiseOnDemand]: 136/149 looper letters, 43 selfloop transitions, 19 changer transitions 0/165 dead transitions. [2025-03-13 21:59:17,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 165 transitions, 598 flow [2025-03-13 21:59:17,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2025-03-13 21:59:17,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8322147651006712 [2025-03-13 21:59:17,745 INFO L175 Difference]: Start difference. First operand has 142 places, 140 transitions, 374 flow. Second operand 3 states and 372 transitions. [2025-03-13 21:59:17,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 165 transitions, 598 flow [2025-03-13 21:59:17,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 165 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:59:17,803 INFO L231 Difference]: Finished difference. Result has 144 places, 157 transitions, 522 flow [2025-03-13 21:59:17,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=144, PETRI_TRANSITIONS=157} [2025-03-13 21:59:17,804 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -6 predicate places. [2025-03-13 21:59:17,804 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 157 transitions, 522 flow [2025-03-13 21:59:17,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:17,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:17,804 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] [2025-03-13 21:59:17,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:59:17,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-13 21:59:17,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:17,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1380821774, now seen corresponding path program 1 times [2025-03-13 21:59:17,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:17,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451050307] [2025-03-13 21:59:17,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:17,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:17,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:59:17,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:59:17,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:17,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:17,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:17,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:17,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451050307] [2025-03-13 21:59:17,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451050307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:17,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:17,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:59:17,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940227162] [2025-03-13 21:59:17,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:17,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:17,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:17,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:17,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:17,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 149 [2025-03-13 21:59:17,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 157 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:17,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:17,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 149 [2025-03-13 21:59:17,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:20,251 INFO L124 PetriNetUnfolderBase]: 15835/37991 cut-off events. [2025-03-13 21:59:20,251 INFO L125 PetriNetUnfolderBase]: For 28317/30205 co-relation queries the response was YES. [2025-03-13 21:59:20,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87085 conditions, 37991 events. 15835/37991 cut-off events. For 28317/30205 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 441919 event pairs, 8895 based on Foata normal form. 23/32240 useless extension candidates. Maximal degree in co-relation 86963. Up to 17896 conditions per place. [2025-03-13 21:59:20,600 INFO L140 encePairwiseOnDemand]: 136/149 looper letters, 59 selfloop transitions, 19 changer transitions 0/183 dead transitions. [2025-03-13 21:59:20,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 183 transitions, 815 flow [2025-03-13 21:59:20,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:20,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2025-03-13 21:59:20,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8344519015659956 [2025-03-13 21:59:20,605 INFO L175 Difference]: Start difference. First operand has 144 places, 157 transitions, 522 flow. Second operand 3 states and 373 transitions. [2025-03-13 21:59:20,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 183 transitions, 815 flow [2025-03-13 21:59:20,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 183 transitions, 763 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:59:20,678 INFO L231 Difference]: Finished difference. Result has 146 places, 174 transitions, 686 flow [2025-03-13 21:59:20,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=146, PETRI_TRANSITIONS=174} [2025-03-13 21:59:20,678 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -4 predicate places. [2025-03-13 21:59:20,679 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 174 transitions, 686 flow [2025-03-13 21:59:20,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:20,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:20,679 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:20,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:59:20,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-13 21:59:20,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:20,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1590942245, now seen corresponding path program 1 times [2025-03-13 21:59:20,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:20,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282492730] [2025-03-13 21:59:20,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:20,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:20,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:59:20,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:59:20,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:20,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:20,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:20,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282492730] [2025-03-13 21:59:20,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282492730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:20,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:20,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:59:20,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966097828] [2025-03-13 21:59:20,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:20,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:20,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:20,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:20,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:20,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 149 [2025-03-13 21:59:20,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 174 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:20,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:20,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 149 [2025-03-13 21:59:20,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:24,759 INFO L124 PetriNetUnfolderBase]: 25435/56087 cut-off events. [2025-03-13 21:59:24,759 INFO L125 PetriNetUnfolderBase]: For 71715/73911 co-relation queries the response was YES. [2025-03-13 21:59:25,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146549 conditions, 56087 events. 25435/56087 cut-off events. For 71715/73911 co-relation queries the response was YES. Maximal size of possible extension queue 2078. Compared 649777 event pairs, 11736 based on Foata normal form. 56/46915 useless extension candidates. Maximal degree in co-relation 146440. Up to 26863 conditions per place. [2025-03-13 21:59:25,289 INFO L140 encePairwiseOnDemand]: 136/149 looper letters, 68 selfloop transitions, 41 changer transitions 0/216 dead transitions. [2025-03-13 21:59:25,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 216 transitions, 1167 flow [2025-03-13 21:59:25,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2025-03-13 21:59:25,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8299776286353467 [2025-03-13 21:59:25,291 INFO L175 Difference]: Start difference. First operand has 146 places, 174 transitions, 686 flow. Second operand 3 states and 371 transitions. [2025-03-13 21:59:25,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 216 transitions, 1167 flow [2025-03-13 21:59:25,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 216 transitions, 1059 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-03-13 21:59:25,645 INFO L231 Difference]: Finished difference. Result has 148 places, 209 transitions, 1058 flow [2025-03-13 21:59:25,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1058, PETRI_PLACES=148, PETRI_TRANSITIONS=209} [2025-03-13 21:59:25,646 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -2 predicate places. [2025-03-13 21:59:25,646 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 209 transitions, 1058 flow [2025-03-13 21:59:25,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:25,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:25,646 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:25,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:59:25,646 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-13 21:59:25,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:25,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1135804275, now seen corresponding path program 1 times [2025-03-13 21:59:25,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:25,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337808350] [2025-03-13 21:59:25,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:25,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:25,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:59:25,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:59:25,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:25,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:25,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:25,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337808350] [2025-03-13 21:59:25,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337808350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:25,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:25,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:59:25,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409387710] [2025-03-13 21:59:25,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:25,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:25,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:25,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:25,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:25,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 149 [2025-03-13 21:59:25,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 209 transitions, 1058 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:25,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:25,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 149 [2025-03-13 21:59:25,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:29,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L690-2-->L690: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][286], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 18#L689-1true, 83#L689-1true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 137#L690true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 10#L691-1true, 147#true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:29,375 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-03-13 21:59:29,375 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-13 21:59:29,375 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-13 21:59:29,375 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-13 21:59:29,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][285], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, 18#L689-1true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 10#L691-1true, 147#true, 168#true, 98#L689-1true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:29,381 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-03-13 21:59:29,381 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-13 21:59:29,381 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-13 21:59:29,381 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-13 21:59:29,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([543] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][284], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-1true, Black: 163#true, 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 10#L691-1true, 147#true, 21#L690true, 168#true, 98#L689-1true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:29,409 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-03-13 21:59:29,409 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-13 21:59:29,409 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-13 21:59:29,409 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-13 21:59:30,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([543] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][284], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-1true, 122#L692true, 145#true, Black: 163#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 147#true, 21#L690true, 98#L689-1true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:30,022 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2025-03-13 21:59:30,022 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-13 21:59:30,022 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-13 21:59:30,022 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-13 21:59:30,051 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][285], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, 18#L689-1true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 122#L692true, 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 147#true, 98#L689-1true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:30,052 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2025-03-13 21:59:30,052 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-13 21:59:30,052 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-13 21:59:30,052 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-13 21:59:30,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L690-2-->L690: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][286], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 18#L689-1true, 83#L689-1true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 122#L692true, 145#true, 137#L690true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 147#true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:30,055 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2025-03-13 21:59:30,055 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-13 21:59:30,055 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-13 21:59:30,055 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-13 21:59:31,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([547] L691-3-->L691-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][295], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-1true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 66#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 10#L691-1true, 147#true, 175#(= |#race~x~0| 0), 168#true, 98#L689-1true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:31,131 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-03-13 21:59:31,131 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-13 21:59:31,131 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-13 21:59:31,132 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-13 21:59:31,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L690-2-->L690: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][297], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-1true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 137#L690true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 10#L691-1true, 147#true, 168#true, 103#L690-1true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:31,181 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2025-03-13 21:59:31,181 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-13 21:59:31,181 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-13 21:59:31,181 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-13 21:59:31,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][296], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 10#L691-1true, 147#true, 98#L689-1true, 103#L690-1true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:31,207 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2025-03-13 21:59:31,207 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-13 21:59:31,207 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-13 21:59:31,207 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-13 21:59:31,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([547] L691-3-->L691-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][295], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-1true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 122#L692true, 145#true, 66#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 147#true, 175#(= |#race~x~0| 0), 98#L689-1true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:31,749 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2025-03-13 21:59:31,749 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-13 21:59:31,749 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-13 21:59:31,749 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-13 21:59:31,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][296], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 122#L692true, 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 147#true, 103#L690-1true, 98#L689-1true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:31,936 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-03-13 21:59:31,936 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 21:59:31,936 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 21:59:31,936 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 21:59:31,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L690-2-->L690: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][297], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-1true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 122#L692true, 137#L690true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 147#true, 168#true, 103#L690-1true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:31,972 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-03-13 21:59:31,972 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 21:59:31,972 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 21:59:31,973 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 21:59:32,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][132], [130#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 147#true, 12#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 168#true, 98#L689-1true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:32,221 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2025-03-13 21:59:32,221 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-13 21:59:32,221 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-13 21:59:32,221 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-13 21:59:33,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][170], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 10#L691-1true, 147#true, 143#L691-1true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:33,079 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-13 21:59:33,079 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-13 21:59:33,079 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-13 21:59:33,079 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-13 21:59:33,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([543] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][172], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 145#true, Black: 163#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 10#L691-1true, 147#true, 90#L691-1true, 21#L690true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:33,155 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-13 21:59:33,155 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-13 21:59:33,155 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-13 21:59:33,155 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-13 21:59:33,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L690-2-->L690: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][200], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 137#L690true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 10#L691-1true, 147#true, 61#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 143#L691-1true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:33,353 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-13 21:59:33,353 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-13 21:59:33,353 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-13 21:59:33,353 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-13 21:59:33,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][170], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 70#L692true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 10#L691-1true, 147#true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:33,693 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,693 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,693 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,693 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][170], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 122#L692true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 147#true, 143#L691-1true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:33,694 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,694 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,694 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,694 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([543] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][172], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 145#true, Black: 163#true, 86#L692true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 10#L691-1true, 147#true, 21#L690true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:33,763 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,763 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,763 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,763 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([543] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][172], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 163#true, 122#L692true, 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 147#true, 90#L691-1true, 21#L690true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:33,763 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,763 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,763 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,763 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,772 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L690-2-->L690: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][200], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 70#L692true, 137#L690true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 10#L691-1true, 147#true, 61#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:33,772 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,772 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,772 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,772 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L690-2-->L690: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][200], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 122#L692true, 145#true, 137#L690true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 147#true, 61#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 143#L691-1true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:33,776 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,776 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,776 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,776 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 21:59:33,891 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([547] L691-3-->L691-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][211], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 66#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 10#L691-1true, 147#true, 90#L691-1true, 175#(= |#race~x~0| 0), 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:33,891 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-13 21:59:33,891 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-13 21:59:33,891 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-13 21:59:33,891 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-13 21:59:34,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][170], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 122#L692true, 145#true, 70#L692true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 147#true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:34,268 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-03-13 21:59:34,268 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-13 21:59:34,268 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-13 21:59:34,268 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-13 21:59:34,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([543] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][172], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 122#L692true, Black: 163#true, 145#true, 86#L692true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 147#true, 21#L690true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:34,361 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-03-13 21:59:34,361 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-13 21:59:34,361 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-13 21:59:34,361 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-13 21:59:34,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L690-2-->L690: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][200], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 122#L692true, 70#L692true, 137#L690true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 173#true, 147#true, 61#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:34,371 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-03-13 21:59:34,371 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-13 21:59:34,371 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-13 21:59:34,371 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-13 21:59:34,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([547] L691-3-->L691-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][211], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 86#L692true, 66#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 10#L691-1true, 147#true, 175#(= |#race~x~0| 0), 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:34,494 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-13 21:59:34,494 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-13 21:59:34,495 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-13 21:59:34,495 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-13 21:59:34,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([547] L691-3-->L691-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][211], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 122#L692true, 66#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 147#true, 90#L691-1true, 175#(= |#race~x~0| 0), 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:34,495 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-13 21:59:34,495 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-13 21:59:34,495 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-13 21:59:34,495 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-13 21:59:34,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([547] L691-3-->L691-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][211], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 122#L692true, 145#true, 86#L692true, 66#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L698true, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 147#true, 175#(= |#race~x~0| 0), 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-13 21:59:34,873 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2025-03-13 21:59:34,873 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-13 21:59:34,873 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-13 21:59:34,873 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-13 21:59:35,601 INFO L124 PetriNetUnfolderBase]: 58260/134342 cut-off events. [2025-03-13 21:59:35,601 INFO L125 PetriNetUnfolderBase]: For 284635/289921 co-relation queries the response was YES. [2025-03-13 21:59:36,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378714 conditions, 134342 events. 58260/134342 cut-off events. For 284635/289921 co-relation queries the response was YES. Maximal size of possible extension queue 4639. Compared 1777832 event pairs, 12497 based on Foata normal form. 113/110767 useless extension candidates. Maximal degree in co-relation 378586. Up to 37476 conditions per place. [2025-03-13 21:59:37,119 INFO L140 encePairwiseOnDemand]: 129/149 looper letters, 113 selfloop transitions, 84 changer transitions 0/302 dead transitions. [2025-03-13 21:59:37,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 302 transitions, 2179 flow [2025-03-13 21:59:37,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2025-03-13 21:59:37,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8389261744966443 [2025-03-13 21:59:37,121 INFO L175 Difference]: Start difference. First operand has 148 places, 209 transitions, 1058 flow. Second operand 3 states and 375 transitions. [2025-03-13 21:59:37,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 302 transitions, 2179 flow [2025-03-13 21:59:37,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 302 transitions, 2031 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:59:37,679 INFO L231 Difference]: Finished difference. Result has 150 places, 291 transitions, 2108 flow [2025-03-13 21:59:37,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2108, PETRI_PLACES=150, PETRI_TRANSITIONS=291} [2025-03-13 21:59:37,680 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 0 predicate places. [2025-03-13 21:59:37,680 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 291 transitions, 2108 flow [2025-03-13 21:59:37,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:37,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:37,681 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:37,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:59:37,681 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-13 21:59:37,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:37,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1038342333, now seen corresponding path program 1 times [2025-03-13 21:59:37,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:37,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857886208] [2025-03-13 21:59:37,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:37,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:37,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 21:59:37,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:59:37,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:37,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:37,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:37,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 21:59:37,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:59:37,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:37,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:37,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:37,700 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:37,700 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-13 21:59:37,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-13 21:59:37,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-13 21:59:37,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-13 21:59:37,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-13 21:59:37,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-13 21:59:37,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-13 21:59:37,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-13 21:59:37,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-13 21:59:37,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-13 21:59:37,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-13 21:59:37,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-13 21:59:37,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-13 21:59:37,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-13 21:59:37,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-13 21:59:37,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-13 21:59:37,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:59:37,701 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-13 21:59:37,701 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:37,701 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-13 21:59:37,734 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:37,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 180 transitions, 400 flow [2025-03-13 21:59:37,748 INFO L124 PetriNetUnfolderBase]: 10/215 cut-off events. [2025-03-13 21:59:37,748 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-13 21:59:37,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 215 events. 10/215 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 726 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 190. Up to 6 conditions per place. [2025-03-13 21:59:37,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 180 transitions, 400 flow [2025-03-13 21:59:37,754 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 180 transitions, 400 flow [2025-03-13 21:59:37,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:37,755 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;@224c39e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:37,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-13 21:59:37,758 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:37,759 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2025-03-13 21:59:37,759 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:59:37,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:37,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:37,759 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-03-13 21:59:37,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:37,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1222024494, now seen corresponding path program 1 times [2025-03-13 21:59:37,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:37,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707879762] [2025-03-13 21:59:37,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:37,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:37,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:59:37,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:59:37,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:37,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:37,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:37,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:37,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707879762] [2025-03-13 21:59:37,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707879762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:37,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:37,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:59:37,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577240425] [2025-03-13 21:59:37,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:37,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:37,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:37,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:37,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:37,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 180 [2025-03-13 21:59:37,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 180 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:37,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:37,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 180 [2025-03-13 21:59:37,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:47,465 INFO L124 PetriNetUnfolderBase]: 60315/134329 cut-off events. [2025-03-13 21:59:47,465 INFO L125 PetriNetUnfolderBase]: For 43154/43154 co-relation queries the response was YES. [2025-03-13 21:59:48,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231019 conditions, 134329 events. 60315/134329 cut-off events. For 43154/43154 co-relation queries the response was YES. Maximal size of possible extension queue 3603. Compared 1713877 event pairs, 45993 based on Foata normal form. 42581/159557 useless extension candidates. Maximal degree in co-relation 178176. Up to 69791 conditions per place. [2025-03-13 21:59:48,957 INFO L140 encePairwiseOnDemand]: 153/180 looper letters, 45 selfloop transitions, 15 changer transitions 0/182 dead transitions. [2025-03-13 21:59:48,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 182 transitions, 556 flow [2025-03-13 21:59:48,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-03-13 21:59:48,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8722222222222222 [2025-03-13 21:59:48,961 INFO L175 Difference]: Start difference. First operand has 181 places, 180 transitions, 400 flow. Second operand 3 states and 471 transitions. [2025-03-13 21:59:48,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 182 transitions, 556 flow [2025-03-13 21:59:48,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 182 transitions, 532 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:48,971 INFO L231 Difference]: Finished difference. Result has 171 places, 170 transitions, 458 flow [2025-03-13 21:59:48,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=171, PETRI_TRANSITIONS=170} [2025-03-13 21:59:48,971 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -10 predicate places. [2025-03-13 21:59:48,971 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 170 transitions, 458 flow [2025-03-13 21:59:48,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:48,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:48,972 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:48,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:59:48,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-03-13 21:59:48,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:48,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1474255664, now seen corresponding path program 1 times [2025-03-13 21:59:48,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:48,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911232902] [2025-03-13 21:59:48,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:48,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:48,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-13 21:59:48,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 21:59:48,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:48,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:48,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:48,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911232902] [2025-03-13 21:59:48,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911232902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:48,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:48,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:59:48,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387014429] [2025-03-13 21:59:48,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:48,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:48,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:48,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:48,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:49,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 180 [2025-03-13 21:59:49,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 170 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:49,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:49,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 180 [2025-03-13 21:59:49,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand